Minimizing crossings in a hierarchical digraphs with a hybridized genetic algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Heuristics Année : 2006

Minimizing crossings in a hierarchical digraphs with a hybridized genetic algorithm

Résumé

Producing clear and intelligible layouts of hierarchical digraphs knows a renewed interest in information visualization. Recent experimental results show that metaheuristics are well-adapted methods for this problem. In this paper, we develop a new Hybridized Genetic Algorithm for arc crossing minimization. It follows the basic scheme of a GA with two major differences: problem-based crossovers adapted from ordering GAs are combined with a local search strategy based on averaging heuristics. Computational testing was performed on a set of 180 random hierarchical digraphs of standard sizes with various structures. Results show that the Hybridized Genetic Algorithm significantly outperforms Tabu Search -which is one of the best known methods for this problem- and also a multi-start descent except for highly connected graphs.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
GrapheGA-Tabu.pdf (114.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00335904 , version 1 (31-10-2008)

Identifiants

Citer

Pascale Kuntz, Bruno Pinaud, Rémi Lehn. Minimizing crossings in a hierarchical digraphs with a hybridized genetic algorithm. Journal of Heuristics, 2006, 12 (1-2), pp.23-36. ⟨10.1007/s10732-006-4296-7⟩. ⟨inria-00335904⟩
65 Consultations
584 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More