Skip to Main content Skip to Navigation
Journal articles

A Multi Ant Colony Optimization Approach For The Traveling Salesman Problem

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Mathurin Soh Connect in order to contact the contributor
Submitted on : Tuesday, September 1, 2020 - 2:56:26 AM
Last modification on : Monday, July 5, 2021 - 6:12:20 PM
Long-term archiving on: : Wednesday, December 2, 2020 - 12:56:13 PM


Article_Soh et al.pdf
Files produced by the author(s)


  • HAL Id : hal-02926738, version 1


Mathurin Soh, Baudoin Nguimeya Tsofack, Clémentin Tayou Djamegni. A Multi Ant Colony Optimization Approach For The Traveling Salesman Problem. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, A paraître. ⟨hal-02926738v1⟩



Les métriques sont temporairement indisponibles