A cooperative search method for the $k$-coloring problem

Bouziri, Hind; Talbi, El-Ghazali; Mellouli, Khaled

Document type :

Article dans une revue scientifique: Article original

DOI :

10.1007/s10852-008-9081-1

Title :

A cooperative search method for the $k$-coloring problem

Author(s) :

Bouziri, Hind [Auteur]
Laboratoire de Recherche Opérationnelle de Décision et de Contrôle de Processus [LARODEC]
Talbi, El-Ghazali [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Mellouli, Khaled [Auteur]
Laboratoire de Recherche Opérationnelle de Décision et de Contrôle de Processus [LARODEC]

Journal title :

Journal of Mathematical Modelling and Algorithms

Pages :

125-142

Publisher :

Springer Verlag

Publication date :

2008-08-16

ISSN :

1570-1166

English keyword(s) :

$k$-Coloring
Fitness landscape
Cooperative method
Iterative search

HAL domain(s) :

Computer Science [cs]/Operations Research [math.OC]

English abstract : [en]

In this paper, a cooperative search method, based on a multi-agent structure is developed to deal with the $k$-coloring problem. Three agents coordinate using an adaptive memory, a search agent, an intensification agent ...
Show more >In this paper, a cooperative search method, based on a multi-agent structure is developed to deal with the $k$-coloring problem. Three agents coordinate using an adaptive memory, a search agent, an intensification agent and a diversification agent. We use the results of a preliminary fitness landscape study to adjust the navigation strategy in the solution space and to fix the search parameters. Our method provides competitive results and it is fast when compared with best existing techniques on instances extracted from the second DIMACS challenge.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :