HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Approche Heuristique Multi Colonie Des Fourmis Pour La Résolution du Problème de Voyageur de Commerce

Abstract : In this paper, we propose a new approach to solving the Travelling Salesman Problem(TSP), for which no exact algorithm is known that allows to find a solution in polynomial time. The pro-posed approach is based on optimization by ants. It puts several colonies in competition for improvedsolutions (in execution time and solution quality) to large TSP instances, and allows to efficiently ex-plore the range of possible solutions. The results of our experiments show that the approach leadsto better results compared to other heuristics from the literature, especially in terms of the quality ofsolutions obtained and execution time
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02958748
Contributor : Mathurin Soh Connect in order to contact the contributor
Submitted on : Tuesday, October 6, 2020 - 11:06:44 AM
Last modification on : Wednesday, October 14, 2020 - 10:25:01 AM
Long-term archiving on: : Thursday, January 7, 2021 - 6:18:45 PM

File

Article_SOH et al_CARI2020.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02958748, version 1

Collections

Citation

Mathurin Soh, Nguimeya Tsofack, Clémentin Djamegni. Approche Heuristique Multi Colonie Des Fourmis Pour La Résolution du Problème de Voyageur de Commerce. Colloque Africain sur la Recherche en Informatique et en Mathématiques Appliquées, Oct 2020, Thiès, Sénégal. ⟨hal-02958748⟩

Share

Metrics

Record views

81

Files downloads

303