Are stacker crane problems easy? A statistical study

DOI10.1016/J.COR.2011.06.017MaRDI QIDQ340228zbMATH OpenOpenAlexFDO

Authors F. Jordan Srour, Steef van de Velde

Publication date 14 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2011.06.017

zbMATH Keywords

traveling salesman problemstacker crane problemasymmetric traveling salesman problemdrayageintermodal freightstatistical analysis of algorithms

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)

Recommendations

• Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems
• Approximation algorithms for the generalized stacker crane problem
• A heuristic for the Stacker Crane Problem on trees which is almost surely exact
• Algorithms and Computation
• Approximation algorithms for multi-vehicle stacker crane problems
• The stacker crane problem and the directed general routing problem
• Preemptive stacker crane problem: extending tree-based properties and construction heuristics
• An ILS-based metaheuristic for the Stacker Crane problem
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem

Cited in

(2)

• The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations

This page was built for publication: Are stacker crane problems easy? A statistical study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340228)