Browse > Article
http://dx.doi.org/10.5394/KINPR.2005.29.2.141

Modified Genetic Operators for the TSP  

Soak Sang Moon (Department of Mechatronics, Gwangju Institute of Science and Technology)
Yang Yeon Mo (Department of Mechatronics, Gwangju Institute of Science and Technology)
Lee Hong Girl (Department of Logistics Engineering, Korea Maritime University)
Ahn Byung Ha (Department of Mechatronics, Gwangju Institute of Science and Technology)
Publication Information
Journal of Navigation and Port Research / v.29, no.2, 2005 , pp. 141-146 More about this Journal
Abstract
For a long time, genetic algorithms have been recognized as a new method to solve difficult and complex problems and the performance of genetic algorithms depends on genetic operators, especially crossover operator. Various problems like the traveling salesman problem, the transportation problem or the job shop problem, in logistics engineering can be modeled as a sequencing problem This paper proposes modified genetic crossover operators to be used at various sequencing problems and uses the traveling salesman problem to be applied to a real world problem like the delivery problem and the vehicle routing problem as a benchmark problem Because the proposed operators use parental information as well as network information, they could show better efficiency in performance and computation time than conventional operators.
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 Whitley, D. Starkweather T. and Fuquay, D.(1989) 'Scheduling Problems and Traveling Salesman: the Genetic Edge Recombination and Operator', Proc. Third Int. Conf. Genetic Algorithms and their Applications, pp.133-140
2 Yang, R.(1997) 'Solving Large Traveling Salesman Problems with Small Populations' Genetic Algorithms in Engineering Systems: Innovations and Applications, pp.157-162
3 Goldberg, D. and Lingle, R.(1985) 'Alleles, Loci and the Traveling Salesman Problem', Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 154-159
4 Goldberg, D.(1989) Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley
5 Grefenstette, J. Gopal, R. Rosmaita, B. and Gucht, D.(1985) 'Genetic Algorithms for the Traveling Salesman Problem', Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp.160-168
6 Holland, J.H.(1992), Adaptation in Natural and Artificial Systems, The MIT Press
7 Mathias, K. and Whitley, D.(1992) 'Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem', Parallel Problem Solving from Nature 2, pp.219-228, North Holland-Elsevier
8 Starkweather, T. McDaniel, S. Mathias, K. Whitley, D. and Whitley, C.(1991) 'A Comparison of Genetic Sequencing Operators', Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Mateo, CA
9 Nguyen, H. D. Yoshihara, I. and Yasunaga, M.(2000) 'Modified Edge Recombination Operators of Genetic Algorithms for the Traveling Salesman Problem', Industrial Electronics Society, IECON 2000. 20 th Annual Conference of the IEEE, Vol. 4, pp. 2815-2820
10 Oliver, I. Smith, D. and Holland, J.(1989) 'A Study of Permutation Crossover Operators on the Traveling Salesman Problem', Proc. of the Second International Conference on Genetic Algorithms, pp. 224-230, July
11 Syswerda, G.(1991) 'Schedule Optimization Using Genetic Algorithms', In L. Davis, ed., Handbook of Genetic Algorithms, pp. 332-349
12 TSPLIB. Web Site, http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB95/TSPLIB.html
13 Davis, L.(1985) 'Applying Adaptive Algorithms to Domains' Proc. of the International Joint Conference on Artificial Intelligence, pp. 162-164
14 Boese, K.D.(1995), 'Cost Versus Distance In the Traveling Salesman Problem', Technical Report CSD-950018, UCLA Computer Science Department