Optimizing pre-processing and relocation moves in the stochastic container relocation problem

DOI10.1016/J.EJOR.2019.11.067MaRDI QIDQ2294635zbMATH OpenOpenAlexWikidataFDO

Authors Bernard G. Zweers, Sandjai Bhulai, R. D. van der Mei

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

zbMATH Keywords

local searchlogisticsbranch-and-boundcontainer pre-marshallingstochastic container relocation problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

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

Cites work

• A heuristic rule for relocating blocks
• A mathematical formulation and complexity considerations for the blocks relocation problem
• A mathematical formulation and efficient heuristics for the dynamic container relocation problem
• A multi-heuristic approach for solving the pre-marshalling problem
• A tree search procedure for the container pre-marshalling problem
• An efficient ant colony optimization algorithm for the blocks relocation problem
• An exact algorithm for the unrestricted block relocation problem
• An improved mathematical formulation for the blocks relocation problem
• An optimization model for the container pre-marshalling problem
• Applying the corridor method to a blocks relocation problem
• Container relocation problem with time windows for container departure
• Container terminal operation and operations research -- a classification and literature review
• Integer programming models for the pre-marshalling problem
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Operations research at container terminals: a literature update
• Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
• Solving the robust container pre-marshalling problem
• Storage yard operations in container terminals: literature overview, trends, and research directions

Cited in

(8)

• An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes
• Smart stacking for import containers using customer information at automated container terminals
• The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
• Pre-processing a container yard under limited available time
• A heuristic procedure for the outbound container relocation problem during export loading operations
• Container relocation problem with time windows for container departure
• On the abstraction method for the container relocation problem
• An algorithm with performance guarantee for the online container relocation problem

Describes a project that uses

Uses Software

• BRP

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)