Ant-Balanced Multiple Traveling Salesmen: ACO-BmTSP
Ant-Balanced Multiple Traveling Salesmen: ACO-BmTSP
About this item
Full title
Author / Creator
Publisher
Basel: MDPI AG
Journal title
Language
English
Formats
Publication information
Publisher
Basel: MDPI AG
Subjects
More information
Scope and Contents
Contents
A new algorithm based on the ant colony optimization (ACO) method for the multiple traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper addresses the problem of solving the mTSP while considering several salesmen and keeping both the total travel cost at the minimum and the tours balanced. Eleven different problems wi...
Alternative Titles
Full title
Ant-Balanced Multiple Traveling Salesmen: ACO-BmTSP
Authors, Artists and Contributors
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_d0782348a81647aa9110969745f41577
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_d0782348a81647aa9110969745f41577
Other Identifiers
ISSN
1999-4893
E-ISSN
1999-4893
DOI
10.3390/a16010037
