A new heuristic algorithm for multiple traveling salesman problem
MetadataShow full item record
CitationNuriyeva, F. & Kızılateş, G. (2017). A new heuristic algorithm for multiple traveling salesman problem. TWMS Journal Of Applied And Engineering Mathematics, 7(1), 101-109.
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.
SourceTWMS Journal Of Applied And Engineering Mathematics
The following license files are associated with this item: