Industrial Engineering and Management Systems

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

Minimizing Empty Trips of Yard Trucks in Container Terminals by Dual Cycle Operations

  • Nguyen, Vu Duc (Department of Industrial Engineering Pusan National University) ;
  • Kim, Kap-Hwan (Department of Industrial Engineering Pusan National University)
  • Received : 2009.10.14
  • Accepted : 2009.12.08
  • Published : 2010.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

One of the most important objectives of the schedules in a container terminal is to minimize the ship operation time, which consists of discharging and loading operation times. Recently, dual cycling techniques have been used for improving terminal operations, especially for reducing the total empty trips of handling equipment. The main focus of this study is to reduce the empty trip times of yard trucks with minimum delays for ship operations. A heuristic algorithm, modified from a previous algorithm, is proposed to solve this problem. A simulation study is conducted to evaluate the effect of different types of discharging and loading schedules and different locating methods for discharging containers in terms of the performance of the system, including the percentage of the dual cycle operations of yard trucks.

Keywords

References

  1. Bish, E. K., Leong, T. Y., Li, C. L., Ng, J. W. C., and David, S. L. (2001), Analysis of a new vehicle scheduling and location problem, Naval Research Logistics, 48, 363-385. https://doi.org/10.1002/nav.1024
  2. Briskorn, D., Drexl, A., and Hartmann, S. (2006), Inventory-based dispatching of automated guided vehicles on container terminals, OR Spectrum, 28, 611-630. https://doi.org/10.1007/s00291-006-0033-8
  3. Evans, J. R. and Minieka, E. (1992), Optimization Algorithms for Networks and Graphs, New York, Marcel Dekker.
  4. Goodchild, A. V. and Daganzo, C. F. (2006), Doublecycling strategies for container ships and their effect on ship loading and discharging operations. Transportation Science, 40, 473-483. https://doi.org/10.1287/trsc.1060.0148
  5. Goodchild, A. V. and Daganzo, C. F. (2007), Crane double cycling in container ports: Planning methods and evaluation. Transportation Research Part B, 41, 875-891. https://doi.org/10.1016/j.trb.2007.02.006
  6. Grunow, M., Günther, H. O., and Lehmann, M. (2006), Strategies for dispatching AGVs at automated seaport container terminals, OR Spectrum, 28, 587-610. https://doi.org/10.1007/s00291-006-0054-3
  7. Kim, K. H. and Bae, J. W. (2004), A look-ahead dispatching method for automated guided vehicles in automated port container terminals, Transportation Science, 38, 224-234. https://doi.org/10.1287/trsc.1030.0082
  8. Lee, D. H., Cao, J. X., Shi, Q., and Chen, J. H. (2009), A heuristic algorithm for yard truck scheduling and storage allocation problems, Transportation Research Part E, 45, 810-820. https://doi.org/10.1016/j.tre.2009.04.008
  9. Lee, S. (2007), Locating idle vehicles in tandem-loop automated guided vehicle systems to minimize the maximum response time, Industrial Engineering & Management Systems, 6, 125-135.
  10. Nguyen, V. D. and Kim, K. H. (2009), A dispatching method for automated lifting vehicles in automated port container terminals, Computers and Industrial Engineering, 56, 1002-1020. https://doi.org/10.1016/j.cie.2008.09.009
  11. Zhang, H. P. and Kim, K. H. (2009), Maximizing the number of dual-cycle operations of quay cranes in container terminals, Computers and Industrial Engineering, 56, 979-992. https://doi.org/10.1016/j.cie.2008.09.008

Cited by

  1. Dispatching Vehicles Considering Multi-lifts of Quay Cranes vol.9, pp.2, 2010, https://doi.org/10.7232/iems.2010.9.2.178
  2. Heuristic Algorithms for Constructing Transporter Pools in Container Terminals vol.14, pp.2, 2013, https://doi.org/10.1109/TITS.2012.2222026