A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM
TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, vol.7, no.1, pp.101-109, 2017 (ESCI, TRDizin)
- Publication Type: Article / Article
- Volume: 7 Issue: 1
- Publication Date: 2017
- Journal Name: TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS
- Journal Indexes: Emerging Sources Citation Index (ESCI), TR DİZİN (ULAKBİM)
- Page Numbers: pp.101-109
- Keywords: multiple traveling salesman problem, heuristic algorithms, shortest path algorithm, insertion heuristic, graph theory
- Dokuz Eylül University Affiliated: Yes
Abstract
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.