EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A New Approach to Efficiently Solving the Traveling Salesman Problem (TSP) by Combining Artificial Intelligence Techniques and Ant Colony Metaheuristics

Baudoin Nguimeya Tsofack, Garrik Brel Jagho Mdemaya, Milliam Maxime Zekeng Ndadji, Maxwell Ndognkom Manga, Mthulisi Velempini

Algorithms · 06.07.2026 · 19 (7) · 552

DOI: 10.3390/a19070552 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algorithms, online erschienen am 06.07.2026. Verfasst von Baudoin Nguimeya Tsofack und 4 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Research Foundation of South Africa.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The efficient resolution of complete NP problems, such as the Traveling Salesman Problem (TSP), particularly for large instances, remains a major challenge in operations research and combinatorial optimization, especially for many businesses, particularly in sectors such as logistics, urban planning, and networks, where efforts are made daily to optimize routes and delivery times. Optimization methods inspired by collective behavior, such as Ant Colony Optimization (ACO), offer competitive results for solving these types of problems. The main problem is the size of the instances because, when it becomes large, many existing algorithms fail to converge to a good solution within a reasonable timeframe: the execution time is generally very long, and the solution obtained is generally far from being the optimal solution to the problem. In this article, we propose a new way of approaching the resolution of the TSP through new metaheuristics inspired by artificial intelligence techniques and ant colony theory. To evaluate the effectiveness of our methodology, particularly the Multi-colony Ant Colony Optimization version 2-SK (MACOV2SK) method, simulations were performed on several instances of the TSP, focusing on large-scale instances. The experimental results clearly demonstrate that the proposed approach significantly improves upon several other approaches in the literature in terms of execution time and solution quality, especially for large-scale problems.

Förderung

  • National Research Foundation of South Africa

Zitieren

APA

Tsofack, B. N., Mdemaya, G. B. J., Ndadji, M. M. Z., Manga, M. N., & Velempini, M. (2026). A New Approach to Efficiently Solving the Traveling Salesman Problem (TSP) by Combining Artificial Intelligence Techniques and Ant Colony Metaheuristics. Algorithms, 19(7), 552. https://doi.org/10.3390/a19070552

Vancouver

Tsofack BN, Mdemaya GBJ, Ndadji MMZ, Manga MN, Velempini M. A New Approach to Efficiently Solving the Traveling Salesman Problem (TSP) by Combining Artificial Intelligence Techniques and Ant Colony Metaheuristics. Algorithms. 2026;19(7):552. doi:10.3390/a19070552

BibTeX
@article{Tsofack2026,
  author = {Tsofack, Baudoin Nguimeya and Mdemaya, Garrik Brel Jagho and Ndadji, Milliam Maxime Zekeng and Manga, Maxwell Ndognkom and Velempini, Mthulisi},
  title = {A New Approach to Efficiently Solving the Traveling Salesman Problem (TSP) by Combining Artificial Intelligence Techniques and Ant Colony Metaheuristics},
  journal = {Algorithms},
  year = {2026},
  volume = {19},
  number = {7},
  pages = {552},
  doi = {10.3390/a19070552}
}
Kostenlos starten →