A tree search heuristic for the container retrieval problem
From MaRDI portal
Publication:5176309
DOI10.1007/978-3-642-29210-1_41zbMath1306.90192OpenAlexW122651092MaRDI QIDQ5176309
Florian Forster, Andreas Bortfeldt
Publication date: 3 March 2015
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29210-1_41
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Loading, unloading and premarshalling of stacks in storage areas: survey and classification ⋮ Solving the container relocation problem by an improved greedy look-ahead heuristic ⋮ An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules
This page was built for publication: A tree search heuristic for the container retrieval problem