NILS: a Neutrality-based Iterated Local ...
Type de document :
Communication dans un congrès avec actes
Titre :
NILS: a Neutrality-based Iterated Local Search and its application to Flowshop Scheduling
Auteur(s) :
Kessaci, Marie-Éléonore [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Dhaenens, Clarisse [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Jourdan, Laetitia [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Liefooghe, Arnaud [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Verel, Sébastien [Auteur]
Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Groupe SCOBI
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Dhaenens, Clarisse [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Jourdan, Laetitia [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Liefooghe, Arnaud [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Verel, Sébastien [Auteur]
Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Groupe SCOBI
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Éditeur(s) ou directeur(s) scientifique(s) :
Peter Merz and Jin-Kao Hao
Titre de la manifestation scientifique :
11th European Conference on Evolutionary Computation in Combinatorial Optimisation
Ville :
Turino
Pays :
Italie
Date de début de la manifestation scientifique :
2011-04-27
Titre de l’ouvrage :
Evolutionary Computation in Combinatorial Optimization
Titre de la revue :
Lecture Notes in Computer Science
Éditeur :
Springer
Date de publication :
2011-04-27
Discipline(s) HAL :
Informatique [cs]/Intelligence artificielle [cs.AI]
Résumé en anglais : [en]
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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-00563459/document
- Accès libre
- Accéder au document
- http://arxiv.org/pdf/1207.4450
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-00563459/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- marmion.pdf
- Accès libre
- Accéder au document
- 1207.4450
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- marmion.pdf
- Accès libre
- Accéder au document