Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
From MaRDI portal
Publication:1694329
DOI10.1016/j.ejor.2017.05.046zbMath1380.90062OpenAlexW2617020525WikidataQ60145745 ScholiaQ60145745MaRDI QIDQ1694329
Publication date: 1 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.05.046
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (19)
Optimizing the number of deployed yard cranes in a container terminal ⋮ The bounded beam search algorithm for the block relocation problem ⋮ Multi-objective optimization of the 3D container stowage planning problem in a barge convoy system ⋮ An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules ⋮ Pre-processing a container yard under limited available time ⋮ A beam search algorithm for minimizing crane times in premarshalling problems ⋮ Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings ⋮ Robust optimization for premarshalling with uncertain priority classes ⋮ 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 ⋮ A branch and bound approach for large pre-marshalling problems ⋮ Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem ⋮ Integer programming models for the pre-marshalling problem ⋮ A local-search based heuristic for the unrestricted block relocation problem ⋮ A new effective unified model for solving the pre-marshalling and block relocation problems ⋮ Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018) ⋮ Optimizing pre-processing and relocation moves in the stochastic container relocation problem ⋮ An exact algorithm for the block relocation problem with a stowage plan ⋮ Deep learning assisted heuristic tree search for the container pre-marshalling problem
Uses Software
Cites Work
- Optimizing liner shipping fleet repositioning plans
- ASlib: a benchmark library for algorithm selection
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- A biased random-key genetic algorithm for the container pre-marshalling problem
- A tree search procedure for the container pre-marshalling problem
- An optimization model for the container pre-marshalling problem
- On the complexity of blocks-world planning
- An exact algorithm for the unrestricted block relocation problem
- Solving the robust container pre-marshalling problem
- A generalized classification scheme for crane scheduling with interference
- An algorithm with performance guarantee for the online container relocation problem
- A feasibility-based heuristic for the container pre-marshalling problem
- A mathematical model of inter-terminal transportation
- A multi-heuristic approach for solving the pre-marshalling problem
- Advanced methods for container stacking
- Strategies for dispatching AGVs at automated seaport container terminals
- Operations research at container terminals: a literature update
- A heuristic rule for relocating blocks
- A Branch and Price Procedure for the Container Premarshalling Problem
- An Investigation of IDA* Algorithms for the Container Relocation Problem
- Models and algorithms for shuffling problems in steel plants
- Modeling and solution for the ship stowage planning problem of coils in the steel industry
- Blocks World revisited
This page was built for publication: Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
