Robust optimization for premarshalling with uncertain priority classes

DOI10.1016/J.EJOR.2020.04.049MaRDI QIDQ2189929zbMATH OpenOpenAlexFDO

Authors Sven Boge, Marc Goerigk, Sigrid Knust

Publication date 17 June 2020

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2020.04.049

zbMATH Keywords

logisticspremarshallingrobust optimizationstorage

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• Solving the robust container pre-marshalling problem
• The gain of robustness for a storage loading problem
• MIP-based approaches for robust storage loading problems with stacking constraints
• Robust storage loading problems with stacking and payload constraints
• A branch and bound approach for large pre-marshalling problems

Cites work

• A biased random-key genetic algorithm for the container pre-marshalling problem
• A branch and bound approach for large pre-marshalling problems
• A feasibility-based heuristic for the container pre-marshalling problem
• A heuristic rule for relocating blocks
• A mathematical formulation and complexity considerations for the blocks relocation problem
• A multi-heuristic approach for solving the pre-marshalling problem
• A new effective unified model for solving the pre-marshalling and block relocation problems
• A NEW MEASURE OF RANK CORRELATION
• A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem
• A tree search procedure for the container pre-marshalling problem
• A tree search procedure for the container relocation problem
• An exact algorithm for the unrestricted block relocation problem
• An improved mathematical formulation for the blocks relocation problem
• Applying the corridor method to a blocks relocation problem
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
• Deep learning assisted heuristic tree search for the container pre-marshalling problem
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• Integer programming models for the pre-marshalling problem
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Recent advances in robust optimization: an overview
• Robust optimization
• Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
• Solving the container relocation problem by an improved greedy look-ahead heuristic
• Solving the robust container pre-marshalling problem
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage

Cited in

(7)

• Solving the robust container pre-marshalling problem
• Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation
• Smart stacking for import containers using customer information at automated container terminals
• Optimizing the number of deployed yard cranes in a container terminal
• A constraint programming approach for the premarshalling problem
• The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
• Solving two-stage quadratic multiobjective problems via optimality and relaxations

Describes a project that uses

Uses Software

• BRP

This page was built for publication: Robust optimization for premarshalling with uncertain priority classes

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