Abstract
Traveling salesman problem (TSP) is a typical NP-hard problem. How to design an effective and efficient algorithm to solve TSP within a limited time is of great theoretical significance and practical significance. This paper studies how the greedy search improves simulated annealing algorithm for solving large-scale TSP. First, the TSP formulation is presented. The aim of the TSP is to structure a shortest route for one traveling salesman starting from a certain location, through all the given cities and finally returning to the original city. Second, a simple simulated annealing (SA) algorithm is developed for the TSP. The orthogonal test is employed to optimize the key parameters. Third, a group of benchmark instances are tested to verify the performance of the SA. The experimental results show that for the small-scale and medium-scale instances the simply SA can search the optimal solution easily. Finally, to solve the large-scale instance, we integrate a greedy search to improve SA. A greedy coefficient is proposed to control the balance of the exploration and the exploitation. Different levels of the greedy coefficient are tested and discussed. The results show that the greedy search can improve SA greatly with a suitable greedy coefficient.
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
Similar content being viewed by others
References
Cui, M., Pan, S., Newell, S., Cui, L.: Strategy, resource orchestration and e-commerce enabled social innovation in Rural China. J. Strateg. Inf. Syst. (2016). http://dx.doi.org/10.1016/j.jsis.2016.10.001
Durbin, R.: An analogue approach to the travelling salesman. Nature 326, 16 (1987)
Durbin, R., Szeliski, R., Yuille, A.: An analysis of the elastic net approach to the traveling salesman problem. Neural Comput. 1(3), 348–358 (1989)
Knox, J.: Tabu search performance on the symmetric traveling salesman problem. Comput. Oper. Res. 21(8), 867–876 (1994)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: A case study in local optim. Local Search Comb. Optim. 1, 215–310 (1997)
Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. BioSystems 43(2), 73–81 (1997)
Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inform. Process. Lett. 103(5), 169–176 (2007)
Farmer, J.D., Packard, N.H., Perelson, A.S.: The immune system, adaptation, and machine learning. Physica D 22(1), 187–204 (1986)
Jolai, F., Ghanbari, A.: Integrating data transformation techniques with Hopfield neural networks for solving travelling salesman problem. Expert Syst. Appl. 37(7), 5331–5335 (2010)
Cheng, M.Y., Prayogo, D.: Symbiotic organism search: a new metaheuristic optimization. Comput. Struct. 139, 98–112 (2014)
Acknowledgement
This paper was partly supported by the National Natural Science Foundation of China under Grant (Grant No.51305024).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Wu, X., Gao, D. (2017). A Study on Greedy Search to Improve Simulated Annealing for Large-Scale Traveling Salesman Problem. In: Tan, Y., Takagi, H., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2017. Lecture Notes in Computer Science(), vol 10386. Springer, Cham. https://doi.org/10.1007/978-3-319-61833-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-61833-3_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61832-6
Online ISBN: 978-3-319-61833-3
eBook Packages: Computer ScienceComputer Science (R0)