An Ant Colony Optimization algorithm for solving the fixed destination multi-depot multiple traveling salesman problem with non-random parameters

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)

Abstract

The Multiple Traveling Salesman Problem (MTSP) is the extension of the Traveling Salesman Problem (TSP) in which the shortest routes of m salesmen all of which start and finish in a single city (depot) will be determined. If there is more than one depot and salesmen start from and return to the same depot, then the problem is called Fixed Destination Multi-depot Multiple Traveling Salesman Problem (MMTSP). In this paper, MMTSP will be solved using the Ant Colony Optimization (ACO) algorithm. ACO is a metaheuristic optimization algorithm which is derived from the behavior of ants in finding the shortest route(s) from the anthill to a form of nourishment. In solving the MMTSP, the algorithm is observed with respect to different chosen cities as depots and non-randomly three parameters of MMTSP: m, K, L, those represents the number of salesmen, the fewest cities that must be visited by a salesman, and the most number of cities that can be visited by a salesman, respectively. The implementation is observed with four dataset from TSPLIB. The results show that the different chosen cities as depots and the three parameters of MMTSP, in which m is the most important parameter, affect the solution.

Original languageEnglish
Title of host publicationInternational Symposium on Current Progress in Mathematics and Sciences 2016, ISCPMS 2016
Subtitle of host publicationProceedings of the 2nd International Symposium on Current Progress in Mathematics and Sciences 2016
EditorsKiki Ariyanti Sugeng, Djoko Triyono, Terry Mart
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735415362
DOIs
Publication statusPublished - 10 Jul 2017
Event2nd International Symposium on Current Progress in Mathematics and Sciences 2016, ISCPMS 2016 - Depok, Jawa Barat, Indonesia
Duration: 1 Nov 20162 Nov 2016

Publication series

NameAIP Conference Proceedings
Volume1862
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

Conference2nd International Symposium on Current Progress in Mathematics and Sciences 2016, ISCPMS 2016
CountryIndonesia
CityDepok, Jawa Barat
Period1/11/162/11/16

Fingerprint Dive into the research topics of 'An Ant Colony Optimization algorithm for solving the fixed destination multi-depot multiple traveling salesman problem with non-random parameters'. Together they form a unique fingerprint.

Cite this