User Manual
Why can I only view 3 results?
You can only view all results when you connect from the network of institutions that are members. We offer a 1-month free trial version for institutions that are not members upon application by institution officials.
A lot of results that are not mine are coming?
Since citations are shown as "Surname, I" in many references, citations of academics with the same surname and first letter of their name can sometimes get mixed up. This is a common problem in citation indexes all over the world.
How can I only see the citations made to my relevant article?
After searching for the name of your article, you can see the citations made to the article you selected as soon as you click on the details section.
Corporate References SED Quartile F.A.Q User Manual Contact Us
Institutional Application Journal Application
Turkish English
SHkRnHgBu-adCBSElSt3
  Citation Number 2
 Views 30
 Downloands 2
Menu
Mendeley
Endnote
A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM
2017
Journal:  
TWMS Journal of Applied and Engineering Mathematics
Author :  
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.

Keywords :