Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization

Daniel Diaz
Salvador Abreu

Résumé

Several real-life applications can be stated in terms of the Quadratic Assignment Problem. Finding an optimal assignment is com-putationally very difficult, for many useful instances. We address this problem using a local search technique, based on Extremal Optimization and present experimental evidence that this approach is competitive. Moreover, cooperative parallel versions of our solver improve performance so much that large and hard instances can be solved quickly.
Fichier principal
Vignette du fichier
Munera.pdf (443.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01332524 , version 1 (16-06-2016)

Identifiants

Citer

Danny Munera, Daniel Diaz, Salvador Abreu. Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization. 16th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2016, Mar 2016, Porto, Portugal. ⟨10.1007/978-3-319-30698-8_17⟩. ⟨hal-01332524⟩

Collections

UNIV-PARIS1 CRI
74 Consultations
745 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More