An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals

Kap Hwan Kim and Ki Young Kim
Additional contact information
Kap Hwan Kim: Department of Industrial Engineering (Research Institute of Mechanical Technology), Pusan National University, 30 Changjeon-dong, Kumjeong-ku, Pusan 609-735, South Korea
Ki Young Kim: Research Institute of Mechanical Technology, Pusan National University, 30 Changjeon-dong, Kumjeong-ku, Pusan 609-735, South Korea

Transportation Science, 1999, vol. 33, issue 1, 17-33

Abstract: This paper focuses on how to optimally route transfer cranes in a container yard during loading operations of export containers at port terminals. Decision variables are the number of containers that a transfer crane picks up at each yard-bay and the sequence of yard-bays that a transfer crane visits during a loading operation. This routing problem is formulated as a mixed integer program. The objective function of the formulation is to minimize the total container handling time of a transfer crane, which includes setup time at each yard-bay and travel time between yard-bays. Based on the mixed integer program, an optimizing algorithm is developed.

Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (30)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.33.1.17 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:33:y:1999:i:1:p:17-33

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().