Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem
From MaRDI portal
Publication:6164614
DOI10.1016/j.cor.2023.106238MaRDI QIDQ6164614
Lebao Wu, Zu-Hua Jiang, Fuhua Wang
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- The parallel stack loading problem to minimize blockages
- 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
- An optimization model for the container pre-marshalling problem
- The stack loading and unloading problem
- Deriving decision rules to locate export containers in container yards
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- A feasibility-based heuristic for the container pre-marshalling problem
- Integer programming models for the pre-marshalling problem
- Two-stage search algorithm for the inbound container unloading and stacking problem
- A branch-and-cut algorithm for the restricted block relocation problem
- Solution approaches for storage loading problems with stacking constraints
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- A branch and bound approach for large pre-marshalling problems
- Pre-processing a container yard under limited available time
- A beam search algorithm for minimizing crane times in premarshalling problems
- A Branch and Price Procedure for the Container Premarshalling Problem
This page was built for publication: Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem
