Solving the container relocation problem by an improved greedy look-ahead heuristic
From MaRDI portal
Publication:300075
DOI10.1016/j.ejor.2014.07.038zbMath1338.90052OpenAlexW2031041022MaRDI QIDQ300075
Andrew E. B. Lim, Wenbin Zhu, Bo Jin
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.07.038
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (24)
An improved mathematical formulation for the blocks relocation problem ⋮ Container relocation problem with time windows for container departure ⋮ New insights on the block relocation problem ⋮ An exact algorithm for the unrestricted block relocation problem ⋮ On the abstraction method for the container relocation problem ⋮ A biased random-key genetic algorithm for the container pre-marshalling problem ⋮ 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 weighted-sum method for solving the bi-objective traveling thief problem ⋮ On the integration of the parallel stack loading problem with the block relocation problem ⋮ Mathematical formulation and heuristic algorithm for the block relocation and loading problem ⋮ Robust optimization for premarshalling with uncertain priority classes ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ The blocks relocation problem with item families minimizing the number of reshuffles ⋮ A new modeling approach for the unrestricted block relocation problem ⋮ An exact approach to the restricted block relocation problem based on a new integer programming formulation ⋮ Two-stage search algorithm for the inbound container unloading and stacking problem ⋮ A feasibility-based heuristic for the container pre-marshalling problem ⋮ An efficient ant colony optimization algorithm for the blocks relocation problem ⋮ A local-search based heuristic for the unrestricted block relocation problem ⋮ A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations ⋮ Stowage plan based slot optimal allocation in rail-water container terminal ⋮ An exact algorithm for the block relocation problem with a stowage plan ⋮ The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage
Uses Software
Cites Work
- A tree search procedure for the container pre-marshalling problem
- Applying the corridor method to a blocks relocation problem
- An optimization model for the container pre-marshalling problem
- A note on deriving decision rules to locate export containers in container yards
- Deriving decision rules to locate export containers in container yards
- A tree search procedure for the container relocation problem
- A heuristic rule for relocating blocks
- A heuristic for retrieving containers from a yard
- A tree search heuristic for the container retrieval problem
This page was built for publication: Solving the container relocation problem by an improved greedy look-ahead heuristic
