Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2012

Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem

Résumé

We present computational results with a heuristic algorithm for the parallel machines total weighted tardiness problem. The algorithm combines generalized pairwise interchange neighborhoods, dynasearch optimization and a new machine-based neighborhood whose size is non-polynomial in the number of machines. The computational results significantly improve over the current state of the art for this problem.
Fichier principal
Vignette du fichier
dellacroce_iterated_cor_12.pdf (248.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01905786 , version 1 (26-10-2018)

Identifiants

Citer

F Della Croce, Thierry Garaix, A. Grosso. Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. Computers and Operations Research, 2012, 39 (6), pp.1213 - 1217. ⟨10.1016/j.cor.2010.10.017⟩. ⟨hal-01905786⟩
51 Consultations
53 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More