EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Ant-Balanced Multiple Traveling Salesmen: ACO-BmTSP

Sílvia de Castro Pereira, Eduardo J. Solteiro Pires, Paulo B. de Moura Oliveira

Algorithms · 07.01.2023 · 16 (1) · 37

DOI: 10.3390/a16010037 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algorithms, online erschienen am 07.01.2023. Verfasst von Sílvia de Castro Pereira und 2 weiteren Autor:innen. Die Arbeit wurde bisher 13-mal zitiert (Crossref) und nennt 48 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 with several variants were analyzed to validate the method. The 20 variants considered three to twenty salesmen regarding 11 to 783 cities. The results were compared with best-known solutions (BKSs) in the literature. Computational experiments showed that a total of eight final results were better than those of the BKSs, and the others were quite promising, showing that with few adaptations, it will be possible to obtain better results than those of the BKSs. Although the ACO metaheuristic does not guarantee that the best solution will be found, it is essential in problems with non-deterministic polynomial time complexity resolution or when used as an initial bound solution in an integer programming formulation. Computational experiments on a wide range of benchmark problems within an acceptable time limit showed that compared with four existing algorithms, the proposed algorithm presented better results for several problems than the other algorithms did.

Zitieren

APA

Pereira, S. D. C., Pires, E. J. S., & Oliveira, P. B. D. M. (2023). Ant-Balanced Multiple Traveling Salesmen: ACO-BmTSP. Algorithms, 16(1), 37. https://doi.org/10.3390/a16010037

Vancouver

Pereira SDC, Pires EJS, Oliveira PBDM. Ant-Balanced Multiple Traveling Salesmen: ACO-BmTSP. Algorithms. 2023;16(1):37. doi:10.3390/a16010037

BibTeX
@article{Pereira2023,
  author = {Pereira, Sílvia de Castro and Pires, Eduardo J. Solteiro and Oliveira, Paulo B. de Moura},
  title = {Ant-Balanced Multiple Traveling Salesmen: ACO-BmTSP},
  journal = {Algorithms},
  year = {2023},
  volume = {16},
  number = {1},
  pages = {37},
  doi = {10.3390/a16010037}
}
Kostenlos starten →