Heuristic for the preemptive asymmetric stacker crane problem

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [39 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00678520
Contributor : Bastien Doreau <>
Submitted on : Tuesday, March 13, 2012 - 11:15:09 AM
Last modification on : Thursday, February 7, 2019 - 2:39:45 PM
Long-term archiving on: Wednesday, December 14, 2016 - 12:13:09 PM

File

RR-09-01b.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

324

Files downloads

146