Sequencing Two Cooperating Automated Stacking Cranes in a Container Terminal

Authors:
Iris F. A. Vis;Hector J. Carlo
Affiliations:
Faculty of Economics and Business Administration, VU University Amsterdam, 1081 HV Amsterdam, The Netherlands;Industrial Engineering Department, University of Puerto Rico at Mayagüez, Mayagüez, Puerto Rico 00681
Venue:
Transportation Science
Year:
2010

Citing 7
Cited 3

Evaluation of the number of rehandles in container yards

Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals

Transportation Science
Analysis and Algorithms for the Transtainer Routing Problem in Container Port Operations

Transportation Science
Hongkong International Terminals Gains Elastic Capacity Using a Data-Intensive Decision-Support System

Interfaces
Comparison of three automated stacking alternatives by means of simulation

WSC '05 Proceedings of the 37th conference on Winter simulation
Double-Cycling Strategies for Container Ships and Their Effect on Ship Loading and Unloading Operations

Transportation Science
Scheduling of Container Storage and Retrieval

Operations Research

Scheduling yard cranes considering crane interference

ICCL'11 Proceedings of the Second international conference on Computational logistics
Real-time scheduling of twin stacking cranes in an automated container terminal using a genetic algorithm

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Effects of storage block layout and automated yard crane systems on the performance of seaport container terminals

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

The containerized trade market is growing rapidly with the uprising of the Far East. Container ports worldwide should be responsive by developing tools to handle these massive volumes of containers in order to retain their level of competitiveness. One of the areas in a container terminal that is highly affected by the increase in the demand of containers is the stack. The stack is used to temporarily store containers upon further transport to their destination. This study is concerned with scheduling sea and landside storages and retrievals in a stack with two cooperating automated stacking cranes working in a single block. We present a mathematical model to minimize the makespan for both cranes. Both an algorithm to derive a lower bound for the makespan and a simulated-annealing based heuristic are proposed to efficiently solve the problem. Numerical experiments show that the solutions of the heuristic method are within 2% of the lower bound for large instances.