International Journal of Fuzzy Logic and Intelligent Systems

Korean Institute of Intelligent Systems (한국지능시스템학회)
권호 표지
DOI QR코드

DOI QR Code

A New Approach to Solve the TSP using an Improved Genetic Algorithm

  • Gao, Qian (College of Information Technology, University of Suwon) ;
  • Cho, Young-Im (College of Information Technology, University of Suwon) ;
  • Xi, Su Mei (College of Information Technology, University of Suwon)
  • Received : 2011.11.01
  • Accepted : 2011.12.04
  • Published : 2011.12.25
Download PDF
⟨ Previous Next ⟩

Abstract

Genetic algorithms are one of the most important methods used to solve the Traveling Salesman Problem. Therefore, many researchers have tried to improve the Genetic Algorithm by using different methods and operations in order to find the optimal solution within reasonable time. This paper intends to find a new approach that adopts an improved genetic algorithm to solve the Traveling Salesman Problem, and compare with the well known heuristic method, namely, Kohonen Self-Organizing Map by using different data sets of symmetric TSP from TSPLIB. In order to improve the search process for the optimal solution, the proposed approach consists of three strategies: two separate tour segments sets, the improved crossover operator, and the improved mutation operator. The two separate tour segments sets are construction heuristic which produces tour of the first generation with low cost. The improved crossover operator finds the candidate fine tour segments in parents and preserves them for descendants. The mutation operator is an operator which can optimize a chromosome with mutation successfully by altering the mutation probability dynamically. The two improved operators can be used to avoid the premature convergence. Simulation experiments are executed to investigate the quality of the solution and convergence speed by using a representative set of test problems taken from TSPLIB. The results of a comparison between the new approach using the improved genetic algorithm and the Kohonen Self-Organizing Map show that the new approach yields better results for problems up to 200 cities.

Keywords

References

  1. K. Kurbel, B. Schneider, and K. Singh, "Solving optimization problems by parallel recombinative simulated annealing on a parallel computer-an application to standard cell placement in VLSI design," IEEE Transactions on Systems, Man and Cybernetics, Part B, vol.28, no.3, pp.454-461, 1998. https://doi.org/10.1109/3477.678649
  2. G. Reinelt, "TSPLIB-A Traveling Salesman Problem Library," ORSA Journal on Computing, vol. 3, no. 4, pp. 376-384, 1991. https://doi.org/10.1287/ijoc.3.4.376
  3. P. Larranaga, C. M. H. Kuijpers, R. H. Murga, I. Innza and S. Dizdarevic, "Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators," s1: A rtif. Intell, vol. 13, no. 2, pp.129-170, 1999. https://doi.org/10.1023/A:1006529012972
  4. J. Holland, "Adaptation in Natural Artificial Systems," the University of Michigan Press (Second edition; MIT Press), 1992.
  5. M. Yoshikawa, T. Fujino, and H. Terai, "A Novel Genetic Algorithm Routing Technique in 3-Dimetional Space," Proceedings of the 10th World Multiconference on Systemics, Cybernetics and Informatics, vol.1, pp.70-75, 2006.
  6. S. Nakaya, Koide and T. Wakabayashi, S, "An adaptive genetic algorithm for VLSI floor planning based on sequence-pair," Proc. IEEE ISCAS, vol.3, pp.65-68, 2000.
  7. V. Ravi, B.S.N. Murty, and J. Reddy, "Nonequilibrium simulated-annealing algorithm applied to reliability optimization of complex systems," IEEE Transactions on Reliability, vol. 46, no.2, pp.233-239, 1997. https://doi.org/10.1109/24.589951
  8. K. A. Smith, "Neural networks for combinatorial optimization: A review of more than a decade of research," INFORMS J. on Computing, vol. 11, no.1, pp. 15-34, 1999. https://doi.org/10.1287/ijoc.11.1.15
  9. Kohonen, T, "The self-organizing map," Proceedings of the IEEE, vol.78, no.9, pp.74-90, 1990.
  10. T. Kohonen, S. Kaski, K. Lagus, J. Salojarvi, V. Paatero, and A. Saarela, "Organization of a massive document collection," IEEE Trans. Neural Networks, vol. 11, pp. 574-585, May 2000. https://doi.org/10.1109/72.846729
  11. TSBLIB, http://www.iwr.uni-eidelberg.de/iwr/comopt/soft/TSPLIB95/TSPLIB.html. [Online] [Cited: 12 22, 2008.
  12. A. S. Nissinen and H. Hyotyniemi, "Evolutionary training of behavior based self-organizing map," in Proc. 1998 IEEE Int. Joint Conf. Neural Networks, vol. 1, pp. 660-665, 1998.
  13. Yanping Bai, Wendong Zhang, and Zhen Jin, "An new self-organizing maps strategy for solving the traveling salesman problem," Chaos, Solitons and Fractals, vol.28, pp.1082-1089, 2006. https://doi.org/10.1016/j.chaos.2005.08.114
  14. T. Kohonen, "Self-organized formation of topologically correct feature maps," Biol. Cybern., vol. 43, no. 2, pp. 59-69, 1982. https://doi.org/10.1007/BF00337288
  15. S. Lin and B.W. Kernighan, "An Effective Heuristic Algorithm for the Traveling Salesman Problem," Operations Research, vol. 21, no.2, pp. 498-516, 1973. https://doi.org/10.1287/opre.21.2.498