Genetic algorithm for process sequencing modelled as the travelling salesman problem with precedence constraints
作者： Noraini Mohd Razali
DOI:
关键词:
摘要: … In this case, the AGVs need to find the shortest route to serve three stations and return to the … distance for both AGVs is considered as the best route. Another application of MTSP is for …
参考文章(110)
L. F. Escudero, On improving a solution to the ATSP with fixed origin and precedence relationships Trabajos De Investigacion Operativa. ,vol. 3, pp. 117- 140 ,(1988) , 10.1007/BF02888669
Eric Taillard, Patrick Siarry, Johann Dreo, Alain Petrowski, Metaheuristics for Hard Optimization: Methods and Case Studies ,(2005)
David Shmoys, Eugene L. Lawler, Alexander H. G. Rinnooy Kan, Jan Karel Lenstra, The traveling salesman problem ,(1985)
Marko Čepin, Assessment of Power System Reliability: Methods and Applications ,(2011)
Robert K. Wysocki, Effective Project Management ,(1994)
Brian J. Rosmaita, John J. Grefenstette, Dirk Van Gucht, Rajeev Gopal, Genetic Algorithms for the Traveling Salesman Problem international conference on genetic algorithms. pp. 160- 168 ,(1985)
Kenneth A. De Jong, Jayshree Sarma, Generation Gaps Revisited foundations of genetic algorithms. ,vol. 2, pp. 19- 28 ,(1993) , 10.1016/B978-0-08-094832-4.50007-6
John H. Holland, Adaptation in natural and artificial systems ,(1992)
Armin Scholl, Data of assembly line balancing problems Research Papers in Economics. ,(1995)
Sue Ellen Haupt, Randy L. Haupt, Practical Genetic Algorithms ,(2004)