Ant Colony Optimization for Multivalent Graph Matching Problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Ant Colony Optimization for Multivalent Graph Matching Problems

Résumé

The Ant Colony Optimization (ACO) meta-heuristic is a bio-inspired approach where a colony of artificial ants cooperates via pheromone trails in order to solve a combinatorial optimization problem. Intuitively, a key point when developing any ACO algorithm is to define the pheromonal strategy, i.e., to decide where pheromone trails should be laid and how they should be exploited and updated during the solution process. In this paper, we study the influence of considering different pheromonal strategies on the ant search capabilities when solving multivalent graph matching problems. Two different ACO algorithms, with respect to two different pheromonal strategies, are proposed and experimentally compared.
Fichier non déposé

Dates et versions

hal-01541565 , version 1 (19-06-2017)

Identifiants

  • HAL Id : hal-01541565 , version 1

Citer

Olfa Sammoud, Christine Solnon, Khaled Ghedira. Ant Colony Optimization for Multivalent Graph Matching Problems. ECAI Workshop on Evolutionary Computation ((EC)2AI 2006), Aug 2006, Trentinon, Italie, Italy. ⟨hal-01541565⟩
104 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More