Share This Article:

An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem

Abstract Full-Text HTML Download Download as PDF (Size:364KB) PP. 61-67
DOI: 10.4236/ajcm.2019.92005    308 Downloads   544 Views  
Author(s)    Leave a comment

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.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

Cite this paper

Czopik, J. (2019) An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem. American Journal of Computational Mathematics, 9, 61-67. doi: 10.4236/ajcm.2019.92005.

References

[1] https://en.wikipedia.org/wiki/Travelling-salesman-problem
[2] https://en.wikipedia.org/wiki/Hungarian-algorithm
[3] https://en.wikipedia.org./wiki/Assignment-problem
[4] http://www.hungarianalgorithm.com/
[5] Kuhn, H. (1955) The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly, 2, 83-97.
https://doi.org/10.1002/nav.3800020109
[6] 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
[7] 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.

  
comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.