Solving the container relocation problem by an improved greedy look-ahead heuristic
From MaRDI portal
Publication:300075
DOI10.1016/J.EJOR.2014.07.038zbMATH Open1338.90052OpenAlexW2031041022MaRDI QIDQ300075FDOQ300075
Andrew Lim, Bo Jin, Wenbin Zhu
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
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- 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 procedure for the container pre-marshalling problem
- A tree search heuristic for the container retrieval 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
Cited In (27)
- A local-search based heuristic for the unrestricted block relocation problem
- Stowage plan based slot optimal allocation in rail-water container terminal
- An efficient ant colony optimization algorithm for the blocks relocation problem
- A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations
- Pre-processing a container yard under limited available time
- Two-stage search algorithm for the inbound container unloading and stacking problem
- Robust optimization for premarshalling with uncertain priority classes
- An improved mathematical formulation for the blocks relocation problem
- An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules
- A Fast Greedy Algorithm for the Relocation Problem
- Container relocation problem with time windows for container departure
- On the abstraction method for the container relocation problem
- Mathematical formulation and heuristic algorithm for the block relocation and loading problem
- The blocks relocation problem with item families minimizing the number of reshuffles
- A feasibility-based heuristic for the container pre-marshalling problem
- 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
- A new modeling approach for the unrestricted block relocation problem
- A tree search procedure for the container relocation problem
- A biased random-key genetic algorithm for the container pre-marshalling problem
- The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage
- An exact algorithm for the unrestricted block relocation problem
- New insights on the block relocation problem
- An exact approach to the restricted block relocation problem based on a new integer programming formulation
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
- An exact algorithm for the block relocation problem with a stowage plan
- A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem
Uses Software
This page was built for publication: Solving the container relocation problem by an improved greedy look-ahead heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300075)