A Variable Neighborhood Descent for solving ...
Type de document :
Communication dans un congrès avec actes
Titre :
A Variable Neighborhood Descent for solving the Single Machine Total Weighted Tardiness Problem
Auteur(s) :
Yahyaoui, Hiba [Auteur]
Krichen, Saoussen [Auteur]
Derbel, Bilel [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Talbi, El-Ghazali [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Krichen, Saoussen [Auteur]
Derbel, Bilel [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Talbi, El-Ghazali [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Titre de la manifestation scientifique :
THE 5th INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO)
Ville :
Hammamet
Pays :
Tunisie
Date de début de la manifestation scientifique :
2013-04-28
Éditeur :
IEEE
Date de publication :
2013-04-28
Discipline(s) HAL :
Informatique [cs]/Intelligence artificielle [cs.AI]
Informatique [cs]/Modélisation et simulation
Mathématiques [math]/Combinatoire [math.CO]
Informatique [cs]/Modélisation et simulation
Mathématiques [math]/Combinatoire [math.CO]
Résumé en anglais : [en]
A Variable Neighborhood Descent (VND) approach is developed to solve the Single Machine Total Weighted Tardiness Problem (SMTWTP). New strategies are proposed to select iteratively the accurate neighborhood. Our approach ...
Lire la suite >A Variable Neighborhood Descent (VND) approach is developed to solve the Single Machine Total Weighted Tardiness Problem (SMTWTP). New strategies are proposed to select iteratively the accurate neighborhood. Our approach was compared to standard VND variants through several experiments assessing the performance of our approach. In particular, we show that improvement can be obtained on many SMTWTP instances.Lire moins >
Lire la suite >A Variable Neighborhood Descent (VND) approach is developed to solve the Single Machine Total Weighted Tardiness Problem (SMTWTP). New strategies are proposed to select iteratively the accurate neighborhood. Our approach was compared to standard VND variants through several experiments assessing the performance of our approach. In particular, we show that improvement can be obtained on many SMTWTP instances.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :