Abstract
To solve a travelling salesman problem by evolutionary algorithms, a challenging issue is how to identify promising edges that are in the global optimum. The paper aims to provide solutions to improve existing algorithms and to help researchers to develop new algorithms, by considering such a challenging issue. In this paper, three heuristic strategies are proposed for population based algorithms. The three strategies, which are based on statistical information of population, the knowledge of minimum spanning tree, and the distance between nodes, respectively, are used to guide the search of a population. The three strategies are applied to three existing algorithms and tested on a set of problems. The results show that the algorithms with heuristic search perform better than the originals.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Togan, V., Daloglu, A.T.: An improved genetic algorithm with initial population strategy and self-adaptive member grouping. Computers & Structures 86, 1204–1218 (2008)
Yugay, O., Kim, I., Kim, B., Ko, F.: Hybrid genetic algorithm for solving travelling salesman problem with sorted population. In: Third International Conference on Convergence and Hybrid Information Technology, pp. 1024–1028. IEEE, Busan (2008)
Ray, S.S., Bandyopadhyay, S., Pal, S.K.: Genetic operators for combinatorial optimization in tsp and microarray gene ordering. Applied Intelligence 26, 183–195 (2007)
Albayrak, M., Allahverdi, N.: Development a new mutation operator to solve the travelling salesman problem by aid of genetic algorithms. Expert Systems with Applications 38, 1313–1320 (2011)
Wei, Y., Hu, Y., Gu, K.: Parallel search strategies for tsps using a greedy genetic algorithm. In: Third International Conference on Natural Computation, pp. 786–790. IEEE, Haikou (2007)
Tao, G., Michalewicz, Z.: Inver-over operator for the TSP. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 803–812. Springer, Heidelberg (1998)
Goldberg, D.E., Lingle, R.: Alleles, loci, and the travelling salesman problem. In: Proceedings of the International Conference on Genetic Algorithms and their Applications, pp. 154–159. Lawrence Erlbaum, Pittsburgh (1985)
Davis, L.: Applying adaptive algorithms to epistatic domains. In: Proceeding of 9th International Joint Conference on Artificial Intelligence, pp. 162–164. Citeseer, Greece (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Xia, Y., Li, C., Zeng, S. (2014). Three New Heuristic Strategies for Solving Travelling Salesman Problem. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds) Advances in Swarm Intelligence. ICSI 2014. Lecture Notes in Computer Science, vol 8794. Springer, Cham. https://doi.org/10.1007/978-3-319-11857-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-11857-4_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11856-7
Online ISBN: 978-3-319-11857-4
eBook Packages: Computer ScienceComputer Science (R0)