Research ArticleOpen AccessGoogle Scholar indexed
An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem
Sugar Land, USA
- 1 Sugar Land, USA
American Journal of Computational Mathematics·Volume 09 (2019)·Pages 61–67·Published 8 April 2019·DOI10.4236/ajcm.2019.92005
Copy link · social · email
Abstract
In this paper we applicate the Hungarian algorithm for assignment problem to solve traveling salesman problem. Tree examples of application of algorithm are included.
KeywordsTraveling SalesmanAssignment ProblemPolynomial TimeHungarian Algorithm
- https://en.wikipedia.org/wiki/Travelling-salesman-problem
- https://en.wikipedia.org/wiki/Hungarian-algorithm
- https://en.wikipedia.org./wiki/Assignment-problem
- http://www.hungarianalgorithm.com/
- Kuhn, H. (1955) The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly, 2, 83-97. https://doi.org/10.1002/nav.3800020109
- Munkres, J. (1957) Algorithms for the Assignment and Transportation Problems. Journal of the Society for Industrial and Applied Mathematics, 5, 32-38. https://doi.org/10.1137/0105003
- Abdulkarim, H.A. and Alshammari, I.F. (2015) Comparison of Algorithms for Solving Traveling Salesman Problem. International Journal of Engineering and Advanced Technology, 4, 76-79.