Passer à la navigation principale Passer à la recherche Passer au contenu principal

Application of the "descent with mutations" metaheuristic to a clique partitioning problem

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionContribution à une conférenceRevue par des pairs

Résumé

We study here the application of a metaheuristic, issued from the noising methods and that we call "descent with mutations", to a problem arising in the field of the aggregation of symmetric relations: the clique partitioning of a weighted graph. This local search metaheuristic, of which the design is very simple, is compared with another very efficient metaheuristic, which is a simulated annealing improved by the addition of some ingredients coming from the noising methods. These experiments show that the descent with mutations is at least as efficient for the studied problem as this improved simulated annealing, usually a little better, while, above all, it is much easier to design and to apply.

langue originaleAnglais
titre2007 IEEE International Conference on Research, Innovation and Vision for the Future, RIVF 2007
Pages29-35
Nombre de pages7
Les DOIs
étatPublié - 26 juin 2007
Modification externeOui
Evénement2007 IEEE International Conference on Research, Innovation and Vision for the Future, RIVF 2007 - Hanoi, Viet-Nam
Durée: 5 mars 20079 mars 2007

Série de publications

Nom2007 IEEE International Conference on Research, Innovation and Vision for the Future, RIVF 2007

Une conférence

Une conférence2007 IEEE International Conference on Research, Innovation and Vision for the Future, RIVF 2007
Pays/TerritoireViet-Nam
La villeHanoi
période5/03/079/03/07

Empreinte digitale

Examiner les sujets de recherche de « Application of the "descent with mutations" metaheuristic to a clique partitioning problem ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation