Are stacker crane problems easy? A statistical study

DOI10.1016/j.cor.2011.06.017zbMath1349.68102OpenAlexW2010444249MaRDI QIDQ340228

F. Jordan Srour, Steef L. 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 problemasymmetric traveling salesman problemstacker crane problemdrayageintermodal freightstatistical analysis of algorithms

Mathematics Subject Classification ID

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

Related Items (2)

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

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