NILS: a Neutrality-based Iterated Local Search and its application to Flowshop Scheduling - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

NILS: a Neutrality-based Iterated Local Search and its application to Flowshop Scheduling

Résumé

This paper presents a new methodology that exploits specific characteristics from the fitness landscape. In particular, we are interested in the property of neutrality, that deals with the fact that the same fitness value is assigned to numerous solutions from the search space. Many combinatorial optimization problems share this property, that is generally very inhibiting for local search algorithms. A neutrality-based iterated local search, that allows neutral walks to move on the plateaus, is proposed and experimented on a permutation flowshop scheduling problem with the aim of minimizing the makespan. Our experiments show that the proposed approach is able to find improving solutions compared with a classical iterated local search. Moreover, the tradeoff between the exploitation of neutrality and the exploration of new parts of the search space is deeply analyzed.
Fichier principal
Vignette du fichier
marmion.pdf (159.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00563459 , version 1 (18-07-2012)

Identifiants

Citer

Marie-Eleonore Marmion, Clarisse Dhaenens, Laetitia Jourdan, Arnaud Liefooghe, Sébastien Verel. NILS: a Neutrality-based Iterated Local Search and its application to Flowshop Scheduling. 11th European Conference on Evolutionary Computation in Combinatorial Optimisation, Apr 2011, Turino, Italy. pp.191--202. ⟨hal-00563459⟩
571 Consultations
190 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More