Abstract
This paper presents a new heuristic algorithm based on combining branch and bound algorithm and a dynamic simulation model for the traveling salesman problem. The approach uses the simulation results for creating the best tours within the branch and bound tree. The most advantage of this approach lies in the learning profcedure both in simulation process and B&B algorithm. In order to test the efficiency of the proposed algorithm, several computational experiments were conducted over middle-scale and large-scale problems. As the computational results show the algorithm can be used easily in practice with reasonable accuracy and speed.
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
Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The traveling salesman problem: A computational study. Princeton University Press, Princeton (2006)
Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, San Francisco (1979)
Mascato, P.: On Evolution, Search, Optimization, Genetic algorithm and Martial arts: Towards Mimetic algorithms. Caltech Concurrent Computation program, 79–158 (1989)
Mühlenbein, H.: Parallel Genetic algorithms in combinatorial optimization. Computer Science and Operations research, 441–456 (1992)
Dorigo, M., Maniezzo, V., Colorni, A.: The Ant system: An Autocatalytic optimizing process. Technical Report 91-016. Politecnico di Milano, Italy (1991)
Lin, F., Kao, C., Hsu, C.: Applying the genetic approach to simulated annealing in solving some NP-hard problems. IEEE Transactions on Systems, Man, and Cyberspace 23, 1752–1767 (1993)
Goldberg, D.: Genetic algorithms in Search, Optimization & Machin Learning. Addison Wesley, Reading (1989)
Matsuda, S.: Set theoretic comparison of mappings of combinatorial optimizations problems to Hopfield neural networks. Systems and Computers in Japan 27, 45–49 (1996)
Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large-scale traveling salesman problem. Operations Research 2, 393–410 (1954)
Eastman, W.L.: Linear programming with pattern constraints, Ph.D. Thesis. Harvard University, Cambridge (1958)
Held, M., Karp, R.M.: The traveling salesman problem and minimum spanning trees: Part II. Mathematical programming 1, 6–25 (1971)
Smith, T.H.C., Srinivasan, V., Thompson, G.L.: Computational performance of three sub tour elimination algorithms for solving asymmetric traveling salesman problems. Annals of Discrete Mathematics 1, 495–506 (1977)
Crowder, H., Padberg, M.W.: Solving large-scale symmetric traveling salesman problems to optimality. Management Science 26, 495–509 (1980)
Bodin, L.D., Golden, B.L., Assad, A.A., Ball, M.: Routing and scheduling of vehicles and crews: the state of art. Computers and Operations Research 10, 63–212 (1983)
Liu, S.B., Ng, K.M., Ong, H.L.: A new heuristic algorithm for classical symmetric traveling salesman problem. World Academy of science, Engineering and Technology 27, 267–271 (2007)
Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. Bio Systems 21, 36–45 (1997)
Applegate, D.D., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem, a computational study. Princeton series in Applied Mathematics (2007)
Brest, J., Zerovnik, J.: A heuristic for the asymmetric Travelling Salesman problem. In: The 6th Metaheuristics International Conference (MIC 2005), Vienna (2005)
Liu, F., Zeng, G.: Study of genetic algorithm with reinforcement learning to solve the TSP. Expert Systems with Applications 36, 6995–7001 (2009)
Arora, S.: Polynomial time approximation schemes for Euclidian TSP and other geometric problems. Journal of the ACM 45, 753–782 (1998)
Zhang, W.: Depth-First Branch and Bound versus Local Search: A case study. Information Sciences Institute and Computer Science Department, University of Southern California (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azimi, P., Daneshvar, P. (2010). An Efficient Heuristic Algorithm for the Traveling Salesman Problem. In: Dangelmaier, W., Blecken, A., Delius, R., Klöpfer, S. (eds) Advanced Manufacturing and Sustainable Logistics. IHNS 2010. Lecture Notes in Business Information Processing, vol 46. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12494-5_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-12494-5_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12461-7
Online ISBN: 978-3-642-12494-5
eBook Packages: Computer ScienceComputer Science (R0)