Scheduling of Container Storage and Retrieval

Authors:
Iris F. A. Vis;Kees Jan Roodbergen
Affiliations:
Faculty of Economics and Business Administration, VU University Amsterdam, 1081 HV Amsterdam, The Netherlands;Rotterdam School of Management, Erasmus University, 3000 DR Rotterdam, The Netherlands
Venue:
Operations Research
Year:
2009

Citing 8
Cited 1

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

SIAM Review
Routing straddle carriers for the loading operation of containers using a beam search algorithm

Computers and Industrial Engineering
Simulation Modeling and Analysis

Simulation Modeling and Analysis
An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals

Transportation Science
The Rollon--Rolloff Vehicle Routing Problem

Transportation Science
Vehicle Routing and Scheduling with Full Truckloads

Transportation Science

Sequencing Two Cooperating Automated Stacking Cranes in a Container Terminal

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling the storage and retrieval of containers in the storage area of a container terminal. Some arcs in the underlying directed network must be visited; other arcs may be---but need not be---visited. We can, therefore, consider this problem to be a special case of the directed rural postman problem. We show that this problem can be reformulated as an asymmetric Steiner traveling salesman problem. This reformulation can be efficiently solved to optimality by a combination of optimal assignments in bipartite networks for parts of the problem and dynamic programming for the connections between those parts.