Optimizing the number of deployed yard cranes in a container terminal
From MaRDI portal
Publication:5883816
DOI10.1080/03155986.2022.2106713MaRDI QIDQ5883816
Nima Zaerpour, Kunpeng Li, Amir Gharehgozli
Publication date: 17 March 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.2022.2106713
container terminal; mixed integer programming model; rubber tyred gantry cranes; stacking operations
90C11: Mixed integer programming
90B50: Management decision making, including multiple objectives
90B05: Inventory, storage, reservoirs
Uses Software
Cites Work
- Conservative allocation models for outbound containers in container terminals
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- An improved mathematical formulation for the blocks relocation problem
- The parallel stack loading problem to minimize blockages
- Complexity results for storage loading problems with stacking constraints
- Container relocation problem with time windows for container departure
- Robust storage loading problems with stacking and payload constraints
- A survey on single crane scheduling in automated storage/retrieval systems
- Cooperative twin-crane scheduling
- Location assignment for outbound containers with adjusted weight proportion
- On the abstraction method for the container relocation problem
- A biased random-key genetic algorithm for the container pre-marshalling problem
- A tree search procedure for the container pre-marshalling problem
- Effects of storage block layout and automated yard crane systems on the performance of seaport container terminals
- Development and simulation analysis of real-time, dual-load yard truck control systems for seaport container transshipment terminals
- Mathematical models and solution methods for optimal container terminal yard layouts
- An optimal layout of container yards
- A survey of berth allocation and quay crane scheduling problems in container terminals
- A stochastic model for the throughput analysis of passing dual yard cranes
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- A generalized classification scheme for crane scheduling with interference
- Carbon-efficient deployment of electric rubber-tyred gantry cranes in container terminals with workload uncertainty
- An algorithm with performance guarantee for the online container relocation problem
- A feasibility-based heuristic for the container pre-marshalling problem
- Optimizing the yard layout in container terminals
- Flexible space-sharing strategy for storage yard management in a transshipment hub port
- High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system
- Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018)
- Twin-crane scheduling during seaside workload peaks with a dedicated handshake area
- Smart stacking for import containers using customer information at automated container terminals
- Robust optimization for premarshalling with uncertain priority classes
- Interference aware scheduling of triple-crossover-cranes
- The block relocation problem with appointment scheduling
- An exact approach to the restricted block relocation problem based on a new integer programming formulation
- An exact method for scheduling a yard crane
- An exact algorithm for the block relocation problem with a stowage plan
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- A multi-heuristic approach for solving the pre-marshalling problem
- Tree search for the stacking problem
- A branch and bound approach for large pre-marshalling problems
- Pre-processing a container yard under limited available time
- On the integration of the parallel stack loading problem with the block relocation problem
- Interblock Crane Deployment in Container Terminals
- A mathematical formulation and efficient heuristics for the dynamic container relocation problem
