Skip to Main content Skip to Navigation
Conference papers

Interval-based Initialization Method for Permutation-based Problems

Malika Mehdi 1 Nouredine Melab 1 El-Ghazali Talbi 1 Bouvry Pascal
1 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : When dealing with exponential search spaces and when no special knowledge is available on global optima, initial populations for population-based meta-heuristics should be uniformly distributed on the search space in order to sample basins of attraction of all local optima. In this paper, we propose a new initialization strategy for permutation problems. The new method is based on an original tree representation of the search space. Such representation was previously used for exact methods but never for meta-heuristics. The proposed method has been tested using a parallel Genetic Algorithm implemented in the ParadisEO framework and experimented on the Nationwide Grid5000 experimental grid using the Q3AP (3D QAP) permutation problem. The preliminary results are promising.
Document type :
Conference papers
Complete list of metadatas
Contributor : Malika Mehdi <>
Submitted on : Thursday, October 7, 2010 - 11:55:12 AM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM



Malika Mehdi, Nouredine Melab, El-Ghazali Talbi, Bouvry Pascal. Interval-based Initialization Method for Permutation-based Problems. IEEE Congress on Evolutionary Computation, Jul 2010, Barcelona, Spain. ⟨10.1109/CEC.2010.5586526⟩. ⟨inria-00524216⟩



Record views