An environment based approach for the ant colony convergence - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

An environment based approach for the ant colony convergence

Résumé

Ant colony optimization (ACO) algorithms are a bio inspired solutions which have been very successful in combinatorial problem solving, also known as NP-hard problems, including transportation system optimization. As opposed to exact methods, which could give the best results of a tested problem, this meta-heuristics is based on the stochastic logic but not on theoretical mathematics demonstration (or only on certain well defined applications). According to this, the weak point of this meta-heuristics is his convergence, its termination condition. We can finds many different termination criteria in the scientific literature, yet most of them are costly in resources and unsuitable for practical problems. On the other hand, given the fact that the ACO is a stochastic approach, it seems difficult to decide whether to stop the algorithms in order to have the optimal result of the tested problems. Therefore, the thesis of this paper is to propose an approach based on the environment in order to determine the best termination criteria of the ACO, for an optimized solution.
Fichier principal
Vignette du fichier
Romet2020.pdf (194.63 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-02879630 , version 1 (12-02-2022)

Licence

Paternité

Identifiants

  • HAL Id : hal-02879630 , version 1

Citer

Pierre Romet, Franck Gechter, El-Hassane Aglzim, Olivier Grunder, Sidi-Mohammed Senouci. An environment based approach for the ant colony convergence. 11th International conference on Emerging Ubiquitous Systems and Pervasive Networks (EUSPN 2020), Nov 2020, Madeira, Portugal. ⟨hal-02879630⟩
57 Consultations
21 Téléchargements

Partager

Gmail Facebook X LinkedIn More