Mathurin SOH ; Baudoin Nguimeya Tsofack ; Clémentin Tayou Djamegni - A Multi Ant Colony Optimization Approach For The Traveling Salesman Problem

arima:6752 - Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, July 12, 2021, Volume 34 - 2020 - Special Issue CARI 2020 - https://doi.org/10.46298/arima.6752
A Multi Ant Colony Optimization Approach For The Traveling Salesman Problem

Authors: Mathurin SOH ; Baudoin Nguimeya Tsofack ; Clémentin Tayou Djamegni

In this paper, we propose a new approach to solving the Traveling Salesman Problem (TSP), for which no exact algorithm is known that allows to find a solution in polynomial time. The proposed approach is based on optimization by ants. It puts several colonies in competition for improved solutions (in execution time and solution quality) to large TSP instances, and allows to efficiently explore the range of possible solutions. The results of our experiments show that the approach leads to better results compared to other heuristics from the literature, especially in terms of the quality of solutions obtained and execution time.


Volume: Volume 34 - 2020 - Special Issue CARI 2020
Published on: July 12, 2021
Accepted on: January 15, 2021
Submitted on: September 2, 2020
Keywords: Ants,Colony,Heuristic,Multi-colony,Traveling Salesman Problem,Ants,[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]


Share

Consultation statistics

This page has been seen 27 times.
This article's PDF has been downloaded 18 times.