Optimizing pre-processing and relocation moves in the stochastic container relocation problem
DOI10.1016/J.EJOR.2019.11.067zbMATH Open1441.90044OpenAlexW2991887941WikidataQ126630537 ScholiaQ126630537MaRDI QIDQ2294635FDOQ2294635
Bernard G. Zweers, R. D. van der Mei, Sandjai Bhulai
Publication date: 11 February 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/29209
Recommendations
- Pre-processing a container yard under limited available time
- A local-search based heuristic for the unrestricted block relocation problem
- Research on the model and heuristic algorithm of container relocation problem
- Container relocation problem with time windows for container departure
- On the abstraction method for the container relocation problem
local searchlogisticsbranch-and-boundcontainer pre-marshallingstochastic container relocation problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Container terminal operation and operations research -- a classification and literature review
- Operations research at container terminals: a literature update
- Storage yard operations in container terminals: literature overview, trends, and research directions
- A heuristic rule for relocating blocks
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- A tree search procedure for the container pre-marshalling problem
- A mathematical formulation and complexity considerations for the blocks relocation problem
- Applying the corridor method to a blocks relocation problem
- An optimization model for the container pre-marshalling problem
- An exact algorithm for the unrestricted block relocation problem
- An improved mathematical formulation for the blocks relocation problem
- Container relocation problem with time windows for container departure
- A mathematical formulation and efficient heuristics for the dynamic container relocation problem
- A multi-heuristic approach for solving the pre-marshalling problem
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- Solving the robust container pre-marshalling problem
- Integer programming models for the pre-marshalling problem
- An efficient ant colony optimization algorithm for the blocks relocation problem
Cited In (4)
- Pre-processing a container yard under limited available time
- Smart stacking for import containers using customer information at automated container terminals
- An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
Uses Software
This page was built for publication: Optimizing pre-processing and relocation moves in the stochastic container relocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294635)
