Interval-based Initialization Method for Permutation-based Problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Interval-based Initialization Method for Permutation-based Problems

(1) , (1) , (1) ,
Bouvry Pascal
  • Function : Author
  • PersonId : 866914


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.
Not file

Dates and versions

inria-00524216 , version 1 (07-10-2010)



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⟩
126 View
0 Download



Gmail Facebook Twitter LinkedIn More