A hybrid ILS-VND based hyper-heuristic for ...
Document type :
Communication dans un congrès avec actes
Title :
A hybrid ILS-VND based hyper-heuristic for permutation flowshop scheduling problem
Author(s) :
Yahyaoui, Hiba [Auteur]
Institut Supérieur de Gestion de Tunis [Tunis] [ISG]
Krichen, Saoussen [Auteur]
Institut Supérieur de Gestion de Tunis [Tunis] [ISG]
Derbel, Bilel [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Talbi, El-Ghazali [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Institut Supérieur de Gestion de Tunis [Tunis] [ISG]
Krichen, Saoussen [Auteur]
Institut Supérieur de Gestion de Tunis [Tunis] [ISG]
Derbel, Bilel [Auteur]

Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Talbi, El-Ghazali [Auteur]

Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Conference title :
KES‘2015 19th Int. Conf. on Knowledge-based and Intelligent Information & Engineering Systems
City :
Singapour
Country :
Singapour
Start date of the conference :
2015
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [en]
In this paper an iterated local search (ILS) is embedded with a variable neighborhood Descent (VND) hyper-heuristic. The proposed hyper-heuristic combines low-level heuristics. Several variants from the literature within ...
Show more >In this paper an iterated local search (ILS) is embedded with a variable neighborhood Descent (VND) hyper-heuristic. The proposed hyper-heuristic combines low-level heuristics. Several variants from the literature within the proposed ILS were implemented and tested. This article conducts an empirical study involving hard combinatorial optimization problems, permutation flowshop scheduling problem (PFSP) with the objectives of minimizing makespan and the total flowtime of jobs. The proposed ILS based hyper-heuristic proved its general and applicable across the studied problems.Show less >
Show more >In this paper an iterated local search (ILS) is embedded with a variable neighborhood Descent (VND) hyper-heuristic. The proposed hyper-heuristic combines low-level heuristics. Several variants from the literature within the proposed ILS were implemented and tested. This article conducts an empirical study involving hard combinatorial optimization problems, permutation flowshop scheduling problem (PFSP) with the objectives of minimizing makespan and the total flowtime of jobs. The proposed ILS based hyper-heuristic proved its general and applicable across the studied problems.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://doi.org/10.1016/j.procs.2015.08.199
- Open access
- Access the document
- https://doi.org/10.1016/j.procs.2015.08.199
- Open access
- Access the document
- https://doi.org/10.1016/j.procs.2015.08.199
- Open access
- Access the document
- https://doi.org/10.1016/j.procs.2015.08.199
- Open access
- Access the document
- https://doi.org/10.1016/j.procs.2015.08.199
- Open access
- Access the document
- https://doi.org/10.1016/j.procs.2015.08.199
- Open access
- Access the document
- j.procs.2015.08.199
- Open access
- Access the document