Tree based models and algorithms  for the preemptive asymmetric Stacker Crane problem

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem

0.00 Avg rating0 Votes
Article ID: iaor20127587
Volume: 45
Issue: 3
Start Page Number: 179
End Page Number: 207
Publication Date: Jul 2011
Journal: RAIRO - Operations Research
Authors: , , ,
Keywords: heuristics, programming: integer, heuristics: local search, programming: travelling salesman
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.