American Journal of Computational Mathematics

Volume 9, Issue 2 (June 2019)

ISSN Print: 2161-1203   ISSN Online: 2161-1211

Google-based Impact Factor: 0.42  Citations  

An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem

HTML  Download Download as PDF (Size: 364KB)  PP. 61-67  
DOI: 10.4236/ajcm.2019.92005    1,401 Downloads   3,760 Views  Citations
Author(s)

Affiliation(s)

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.

Share and Cite:

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.

Cited by

[1] A novel method for prize collecting traveling salesman problem with time windows
Intelligent and Fuzzy Techniques for Emerging …, 2022
[2] Analysis of the Operating Characteristics of Fruits' Seller in Bolgatanga as a Travelling Salesperson Problem
American Journal of Computational and …, 2021
[3] Algoritma Genetika Untuk Menyelesaikan Masalah Travelling Salesman
2021
[4] ESAN-ESA-A new zeros assignment method for finding optimal tour plan of traveling salesman problems
Malaya Journal of Matematik, 2021
[5] Assigning Multiple AUVs to Form Arrays Under Communication Range Limitations Based on the Element Zero Method
2020
[6] PERENCANAAN PERJALANAN MENGELILINGI PROVINSI RIAU DARATAN DENGAN MENGGUNAKAN ALGORITMA KOLONI SEMUT
[7] OPTIMISASI MASALAH TRAVELLING SALESMAN DENGAN ALGORITMA GENETIKA MENGGUNAKAN OPERATOR CYCLE CROSSOVER YANG DIMODIFIKASI

Journals Menu
Follow SCIRP
Contact us
+1 323-425-8868
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat

Copyright © 2024 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.