A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid

Abstract : In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The parallelism in our algorithm is of two hierarchical levels. The first level is an insular model where a number of GAs (genetic algorithms) evolve in parallel. The second level is a parallel transformation of individuals in each GA. Implementation has been done using ParadisEO1 framework, and the experiments have been performed on GRID5000, the French nation-wide computational grid. To evaluate our method, we used three benchmarks derived from QAP instances of QAPLIB and the results are compared with those reported in the literature. The preliminary results show that the method is promising. The obtained solutions are close to the optimal values and the execution is efficient.
Type de document :
Communication dans un congrès
IEEE. IPDPS 2009. IEEE International Symposium on Parallel & Distributed Processing, May 2009, Rome, Italy. IEEE, pp.10.1109/IPDPS.2009.5161126, 2009
Liste complète des métadonnées

https://hal.inria.fr/hal-00690480
Contributeur : Ist Rennes <>
Soumis le : lundi 23 avril 2012 - 16:25:14
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13

Identifiants

  • HAL Id : hal-00690480, version 1

Citation

Lakhdar Loukil, Malika Mehdi, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry. A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid. IEEE. IPDPS 2009. IEEE International Symposium on Parallel & Distributed Processing, May 2009, Rome, Italy. IEEE, pp.10.1109/IPDPS.2009.5161126, 2009. 〈hal-00690480〉

Partager

Métriques

Consultations de la notice

218