Tree based heuristics for the preemptive asymmetric stacker crane problem
From MaRDI portal
Publication:2883548
DOI10.1016/J.ENDM.2010.05.006zbMATH Open1237.90269OpenAlexW2087421933MaRDI QIDQ2883548FDOQ2883548
Authors: Alain Quilliot, Mathieu Lacroix, Hélène Toussaint, Hervé L. M. Kerivin
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.006
Recommendations
- Tree based models and algorithms for the preemptive asymmetric stacker crane problem
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics
- Algorithms and Computation
- A heuristic for the Stacker Crane Problem on trees which is almost surely exact
- Approximation algorithms for the generalized stacker crane problem
- Approximation algorithms for multi-vehicle stacker crane problems
- Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems
- Tabu search heuristics for the crane sequencing problem
- An ILS-based metaheuristic for the Stacker Crane problem
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
Cited In (4)
This page was built for publication: Tree based heuristics for the preemptive asymmetric stacker crane problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883548)