Pre-processing a container yard under limited available time

DOI10.1016/j.cor.2020.105045zbMath1458.90161OpenAlexW3038351528MaRDI QIDQ2664376

Bernard G. Zweers, Sandjai Bhulai, Robert D. van der Mei

Publication date: 20 April 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/29695

zbMATH Keywords

branch-and-boundheuristiccontainer relocation problemterminal operationscontainer pre-marshalling problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (9)

Optimizing the number of deployed yard cranes in a container terminal ⋮ An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes ⋮ On the integration of the parallel stack loading problem with the block relocation problem ⋮ A beam search algorithm for minimizing crane times in premarshalling problems ⋮ Scheduling ASC and AGV considering direct, buffer, and hybrid modes for transferring containers ⋮ A constraint programming approach for the premarshalling problem ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem ⋮ A feature-extraction-based lightweight convolutional and recurrent neural networks adaptive computing model for container terminal liner handling volume forecasting

Uses Software

• BRP

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
• An improved mathematical formulation for the blocks relocation problem
• Container relocation problem with time windows for container departure
• A biased random-key genetic algorithm for the container pre-marshalling problem
• A tree search procedure for the container pre-marshalling problem
• A mathematical formulation and complexity considerations for the blocks relocation problem
• A new effective unified model for solving the pre-marshalling and block relocation problems
• Yard crane scheduling for container storage, retrieval, and relocation
• An optimization model for the container pre-marshalling problem
• New insights on the block relocation problem
• An exact algorithm for the unrestricted block relocation problem
• Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
• An efficient ant colony optimization algorithm for the blocks relocation problem
• Integer programming models for the pre-marshalling problem
• A local-search based heuristic for the unrestricted block relocation problem
• Storage yard operations in container terminals: literature overview, trends, and research directions
• Optimizing pre-processing and relocation moves in the stochastic container relocation problem
• Deep learning assisted heuristic tree search for the container pre-marshalling problem
• A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem
• A multi-heuristic approach for solving the pre-marshalling problem
• A branch and bound approach for large pre-marshalling problems
• A heuristic for retrieving containers from a yard
• A mathematical formulation and efficient heuristics for the dynamic container relocation problem

This page was built for publication: Pre-processing a container yard under limited available time