A feasibility-based heuristic for the container pre-marshalling problem
DOI10.1016/j.ejor.2016.05.061zbMath1394.90135OpenAlexW2418431560MaRDI QIDQ1752173
Ning Wang, Bo Jin, Zi-Zhen Zhang, Andrew E. B. Lim
Publication date: 24 May 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.2016.05.061
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (12)
Uses Software
Cites Work
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- Solving the container relocation problem by an improved greedy look-ahead heuristic
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
- 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
- Storage yard operations in container terminals: literature overview, trends, and research directions
- A multi-heuristic approach for solving the pre-marshalling problem
- A Branch and Price Procedure for the Container Premarshalling Problem
This page was built for publication: A feasibility-based heuristic for the container pre-marshalling problem