A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM
Küçük Resim Yok
Tarih
2017
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Turkic World Mathematical Soc
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
The Multiple Traveling Salesman Problem (mTSP) is a combinatorial optimization problem in NP-hard class. The mTSP aims to acquire the minimum cost for traveling a given set of cities by assigning each of them to a different salesman in order to create m number of tours. This paper presents a new heuristic algorithm based on the shortest path algorithm to find a solution for the mTSP. The proposed method has been programmed in C language and its performance analysis has been carried out on the library instances. The computational results show the efficiency of this method.
Açıklama
Anahtar Kelimeler
multiple traveling salesman problem, heuristic algorithms, shortest path algorithm, insertion heuristic, graph theory
Kaynak
Twms Journal of Applied and Engineering Mathematics
WoS Q Değeri
N/A
Scopus Q Değeri
Cilt
7
Sayı
1
