| Issue |
RAIRO-Oper. Res.
Volume 45, Number 3, July-September 2011
|
|
|---|---|---|
| Page(s) | 179 - 207 | |
| DOI | https://doi.org/10.1051/ro/2011110 | |
| Published online | 21 October 2011 | |
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
1
Department of Mathematical Sciences, Clemson University, CLEMSON, O-326,
Martin Hall, Clemson, 29634 SC, USA
2
LIMOS, CNRS UMR 6158, Université Blaise-Pascal, Clermont-Ferrand II,
Complexe Scientifique des Cézeaux, 63177 Aubière Cedex, France. alain.quilliot@isima.fr
Received:
11
November
2009
Accepted:
16
June
2011
In this paper we deal with the preemptive asymmetric stacker crane problem in a 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 an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the preemption hypothesis.
Mathematics Subject Classification: 99-XX
Key words: Preemptive stacker crane problem / routing / local search / heuristics
© EDP Sciences, ROADEF, SMAI, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.