A routing algorithm for a single straddle carrier to load export containers onto a containership

How to route a straddle carrier during loading operation of export containers in port container terminals is discussed. We try to minimize the total travel distance of the straddle carrier in the yard. We determine the number of containers which the straddle carrier picks up at each yard-bay as well...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production economics Vol. 59; no. 1; pp. 425 - 433
Main Authors Young Kim, Ki, Hwan Kim, Kap
Format Journal Article Conference Proceeding
LanguageEnglish
Published Amsterdam Elsevier B.V 20.03.1999
Elsevier Science
Elsevier
Elsevier Sequoia S.A
SeriesInternational Journal of Production Economics
Subjects
Algorithms
Applied sciences
Container ships
Container terminal
Exact sciences and technology
Integer programming
Loading sequence
Operational research and scientific management
Operational research. Management science
Optimization. Search problems
Routing
Shipping industry
Studies
Transportation
Transportation terminals
Loading sequence
Routing
Container terminal
Transportation
Integer programming
Transport
Optimization
Online AccessGet full text

Cover

More Information
Summary:How to route a straddle carrier during loading operation of export containers in port container terminals is discussed. We try to minimize the total travel distance of the straddle carrier in the yard. We determine the number of containers which the straddle carrier picks up at each yard-bay as well as the sequence of yard-bays which the straddle carrier visits during the tour. The objective is to minimize the total travel time of the straddle carrier. This routing problem is formulated as an integer programming. An efficient optimizing algorithm is also developed for the carrier routing problem.
ISSN:0925-5273
1873-7579
DOI:10.1016/S0925-5273(98)00108-X