Abstract
The TSP problem is a typical one in the field of combinatorial optimization. After study other researchers’ related works, this paper presents a hybrid algorithm based on simulated annealing, ant colony and genetic in reference to previous research, in order to improve computing performance. Algorithms of this paper are used for solving traveling salesman problem, and the simulation contrast test results show that the algorithm has better convergence speed and optimal results; it also shows that the algorithm is feasible and effective.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Yang, W.-B., Zhao, Y.-W.: Improved simulated annealing algorithm for TSP. Computer Engineering and Applications 46(15), 34–36 (2010)
Lin, W., Delgado-Frias, J.G., Gause, D.C., et al.: Hybrid newton-raphson genetic algorithm for the traveling salesman problem. Cybernetics and Systems 26(4), 387–412 (1995)
Tan, K.C., Tang, H., Ge, S.S.: On parameter settings of Hopfield networks applied to traveling salesman problems. IEEE Transactions on Circuits and Systems 52(5), 994–1002 (2005)
Stutzle, T., Hhoos, H.: The MAX-MIN ant system and local search for the traveling salesman problem. In: Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC 1997), pp. 309–314. Indianapolis, USA (1997)
Colorni, A., Dor Igo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Proc. Europ. Conf. Artif. Life, p. 1342142. Elsevier Publishing, Paris (1991)
Wu, Q.-H., Zhang, J.-H., Xu, X.-H.: An Ant Colony Algorithm with Mutation Features. Journal of Computer Research & Development 36(10), 1240–1245 (1999)
Xu, Z.-H., Song, B., Guo, Y.-Y.: Using Ant Colony Algorithm and Simulated Annealing Parallel Algorithm to Solve Traveling Salesman Problem. Journal of Hebei University of Technology 39(39), 48–51 (2010)
Zhang, X.-R., Gao, S.: Solving Traveling Salesman Problem by Ant Colony Optimization Genetic Hybrid Algorithm. Microelectronics & Computer 26(4), 81–84 (2009)
Du, Z.-Z., Liu, G.-D.: Solution of TSP problem based on hybrid genetic simulated annealing algorithm. Computer Engineering and Applications 46(29), 40–42 (2010)
Lee, S.G., Jung, T.U., Chvng, T.C.: An effective dynamic weighted rule for ant colony system optimization. In: Proceedings of the 2001 Congress on Evolutionary Computation, vol. (2), pp. 1393–1397 (2001)
Dorigo, M., Gambardella, L.M., Middendorf, M.: Guest editorial special section on ant colony optimization. In: IEEE Transactions on Evolutionary Computation, vol. (6), pp. 317–319 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, X., Tan, Z., Yang, G., Cheng, W. (2012). A Hybrid Algorithm to Solve Traveling Salesman Problem. In: Jin, D., Lin, S. (eds) Advances in Electronic Engineering, Communication and Management Vol.1. Lecture Notes in Electrical Engineering, vol 139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27287-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-27287-5_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27286-8
Online ISBN: 978-3-642-27287-5
eBook Packages: EngineeringEngineering (R0)