A heuristic for the stacker crane problem on trees which is almost surely exact

In: Journal of Algorithms. Volume 61, P. 1--19, 2006

Authors

• Amin Coja-Oghlan
• Sven O. Krumke
• Till Nierhoff

Abstract

Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the edges of G that serves all requests. The server has capacity one, and starts and stops at the same vertex. In this paper, we consider the case that the transportation network G is a tree, and that the requests are chosen randomly according to a certain class of probability distributions. We show that a polynomial time algorithm by Frederickson and Guan [J. Algorithms 15 (1993) 29-60], which guarantees a 4/3-approximation in the worst case, on almost all inputs finds a minimum-cost tour, along with a certificate of the optimality of its output

BibTeX

 
@Article{ Coja-OghlanEtAL:StackerCrane, 
   title = { A heuristic for the stacker crane problem on trees which is almost surely exact }, 
   author = { Amin Coja-Oghlan and Sven O. Krumke and Till Nierhoff },    
   journal = { Journal of Algorithms },  
   volume = { 61 },        
   pages = { 1--19 },   
   year = 2006, 
} 

---

This publication belongs to the project DeNDeMA.