Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)   FALL 2011 , Volume 8 , Number 3 (30); Page(s) 83 To 96.
 
Paper: 

A MODIFIED ELITE ANT COLONY ALGORITHM FOR SOLVING MULTIPLE TRAVELING SALESMEN PROBLEM

 
 
Author(s):  YOUSEFI KHOSHBAKHT M.*, SEDIGHPOUR M.
 
* YOUNG RESEARCHERS CLUB, HAMEDAN BRANCH, ISLAMIC AZAD UNIVERSITY, HAMEDAN, IRAN
 
Abstract: 

The Multiple Traveling Salesman Problem (MTSP) is one of the most famous combinatorial optimization problems in which m>1 traveling salesmen simultaneously start to move from the node in the name of depot and come back to it after visiting n>m customers so that each customer is visited only once by a salesman. The objective is to minimize the total route visited by all the salesmen. In this paper, a modified elite ant colony is applied for this problem differenced in encouragement coefficient of the best route. This coefficient leads that the algorithm has more ability for escaping from local optimum points, and can yield better solutions. Experimental conclusions on standard benchmarks clearly show performance of the new algorithm compared with other meta-heuristic algorithms.

 
Keyword(s): MULTIPLE TRAVELING SALESMAN PROBLEM, ELITE ANT COLONY, PHEROMONE COEFFICIENT, COMBINATORIAL OPTIMIZATION PROBLEMS
 
References: 
  • ندارد
 
  Persian Abstract Yearly Visit 79
 
Latest on Blog
Enter SID Blog