Heuristic for the preemptive asymmetric stacker crane problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2010

Heuristic for the preemptive asymmetric stacker crane problem

Résumé

In this paper, we deal with the preemptive asymmetric stacker crane problem in an heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation a simple, efficient local search heuristic, as well as an original LIP model. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and at evaluating the impact of the preemption hypothesis.
Fichier principal
Vignette du fichier
RR-09-01b.pdf (519.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00678520 , version 1 (13-03-2012)

Identifiants

Citer

Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint. Heuristic for the preemptive asymmetric stacker crane problem. Electronic Notes in Discrete Mathematics, 2010, 36, pp.Pages 41-48. ⟨10.1016/j.endm.2010.05.006⟩. ⟨hal-00678520⟩
146 Consultations
116 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More