A Multi Ant Colony Optimization Approach For The Traveling Salesman Problem - Archive ouverte HAL Access content directly
Journal Articles Revue Africaine de Recherche en Informatique et Mathématiques Appliquées Year : 2021

A Multi Ant Colony Optimization Approach For The Traveling Salesman Problem

(1) , (1) , (1)
1

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.
Fichier principal
Vignette du fichier
Article_SOH et al_Extended_CARI2020 (1).pdf (361.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02926738 , version 1 (01-09-2020)
hal-02926738 , version 2 (14-06-2021)
hal-02926738 , version 3 (06-07-2021)

Identifiers

  • HAL Id : hal-02926738 , version 2

Cite

Mathurin Soh, Baudoin Nguimeya Tsofack, Clémentin Tayou Djamegni. A Multi Ant Colony Optimization Approach For The Traveling Salesman Problem. Revue Africaine de Recherche en Informatique et Mathématiques Appliquées, 2021. ⟨hal-02926738v2⟩
106 View
530 Download

Share

Gmail Facebook Twitter LinkedIn More