Publication:
Optimizing Container Movements Using One and Two Automated Stacking Cranes

Loading...
Thumbnail Image
Authors
Royset, Johannes O.
Dell, Robert F.
Zyngiridis, Ioannis
Subjects
maritime container terminal
storage yard operations
automated stacking crane scheduling
integer linear programming
Advisors
Date of Issue
2009-05
Date
May 2009
Publisher
Language
Abstract
Productivity of a sea port depends, in part, on stacking cranes working in blocks of its storage yard. Each container leaving a block must be moved by a storage-yard crane to a buffer zone during a specific time window so it can reach its destination on time. Containers entering a block for storage must be moved out of the buffer zone sufficiently soon to avoid overflow. In this paper, we formulate integer linear programs to prescribe movements to transport and stack containers in storage yards using one and two equally-sized Automated Stacking Cranes (ASCs) working with straddle carriers. Using real world data, we construct test problems varying both the number of container bays and fullness of the block. We find that one ASC working alone requires up to 70% more time than two ASCs working together to accomplish the same container movements. Optimal solutions of the integer linear programs are typically obtained in only a few seconds.
Type
Article
Description
The article of record as published may be found at http://dx.doi.org/10.3934/jimo.2009.5.285
Series/Report No
Department
Operations Research (OR)
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
18 p.
Citation
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION Volume 5, Number 2, May 2009 pp. 285-302
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections