Title Genetic Algorithm and its in network plan application
Abstract
GA is a searching arithmetic which animates natural biology evolution. Due to it’s simple ,easy and doesn’t need professional knowledge but only adaptation function to instruct searching process, it has been applied to many fields, and achieved good result ,which attracted many scholars and engineers .
GA is a modern optimized technology, which relies on more external condition and knowledge to reach overall optimized searching rapidly. Due to these advantages, GA has been applied in many fields . In the dissertation, the technique of GA is introduced into DCPM ,and the arithmetic is random searching in stead of fixed searching principle in traditional arithmetic, which offered a more general and simple DCPM solution. This methodology helps to realize program ,and because of the parallel feature, in the computer system, it’s easy to solve DCPM problem in the distributing environment .
In the first part of my dissertation, there will be an introduction to data digging technology ,and as GA ,it’s origin, development, basic principle, and typical arithmetic, design and features will be shown in the second part in details . In the third part you will see the explanation to net plan, including the generation, development and features. As an effective overall arithmetic and optimized searching tool, in the fourth part , you will see the examples of GA application in net plan.
