A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM

Nuriyeva F., Kizilates G.

TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, cilt.7, sa.1, ss.101-109, 2017 (ESCI) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 7 Sayı: 1
  • Basım Tarihi: 2017
  • Dergi Adı: TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.101-109
  • Anahtar Kelimeler: multiple traveling salesman problem, heuristic algorithms, shortest path algorithm, insertion heuristic, graph theory, FORMULATIONS
  • Dokuz Eylül Üniversitesi Adresli: Evet

Ö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.