Font Size: a A A

The Application Research Of Improved Parallel Genetic Algorithm

Posted on:2007-12-25Degree:MasterType:Thesis
Country:ChinaCandidate:S LiuFull Text:PDF
GTID:2178360185985238Subject:Traffic Information Engineering & Control
Abstract/Summary:PDF Full Text Request
With economic of market development, many sequences and small quantity become the focal point of the market which manufactory racing to control. In this way, manufactories should be asked to range sequences rationally, take advantage of resource, shorten time limit for a project and reduce cost of producing. So people paid attention to the JSP more and more.The enterprise information systems using in a certain workshop have met lots of difficulties. Both developers and users need a generally designed, widely fitted and highly intelligent support platform for resource optimization. How to resolve the dynamic scheduling problem in order to make an efficient product plan quickly is the primary problem in the scheduling research field. Import of the optimization theory in the field of jop scheduling in workshop, improving the performance of algorithm, and making the algorithm work perfectly are important tasks.In this paper, the improved parallel genetic algorithms is put forward. It is divided into host computer and client in LAN. The host is reponsible for storing the best gene.Through migration, the client send the best gene to the host. So the runing time of system is decreased.The time efficiency of the algorithm is improved. By using the coding method the time information of the operations is drawn fastly and effective.The improved algorithms is tested by using the examples in the standard test set and the results show that the capability is obviously impoved.
Keywords/Search Tags:parallel genetic algorithms, migration strategy, job shop scheduling
PDF Full Text Request
Related items