An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals
- 1 February 1999
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 33 (1), 17-33
- https://doi.org/10.1287/trsc.33.1.17
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.Keywords
This publication has 9 references indexed in Scilit:
- DISTANCE APPROXIMATIONS FOR ROUTING MANUAL PICKERS IN A WAREHOUSEIIE Transactions, 1993
- On the Distance Constrained Vehicle Routing ProblemOperations Research, 1992
- A Vehicle Routing Problem with Stochastic DemandOperations Research, 1992
- A branch and bound solution method for the crane scheduling problemTransportation Research Part B: Methodological, 1990
- Asymptotic expected performance of some TSP heuristics: An empirical evaluationEuropean Journal of Operational Research, 1989
- The crane scheduling problemTransportation Research Part B: Methodological, 1989
- Order Picking In An AisleIIE Transactions, 1988
- A simulation analysis for a transtainer-based container handling facilityComputers & Industrial Engineering, 1988
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1983