Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
An Efficient Heuristic Algorithm for the Traveling Salesman Problem
verfasst von : Parham Azimi, Peyman Daneshvar
Erschienen in: Advanced Manufacturing and Sustainable Logistics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.