EXPLORATION AND OPTIMIZATION OF THE PROBLEM OF MULTIPLE TRAVELING SALESMEN

Vol 56, 2024 - 308953
Complete Articles (CA)
Favorite this paper
How to cite this paper?
Abstract

This paper explores the Multiple Traveling Salesman (mTSP) problem by comparing the Ant Colony optimization model with a previous project that used five heuristics. The mTSP is a variation of the classic Traveling Salesman problem, where n points must be visited by a set of m salesmen, each only once. The algorithms were implemented in Python in this study, with the objective of identifying which of the six metaheuristics obtained the most efficient solution.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Universidade Federal de Viçosa
Track
  • 14. OC – Combinatorial Optimization
Keywords
Heuristics
Multiple Traveling Salesman Problem
Ant Colony (ACO)