JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Minimizing Empty Trips of Yard Trucks in Container Terminals by Dual Cycle Operations
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Minimizing Empty Trips of Yard Trucks in Container Terminals by Dual Cycle Operations
Nguyen, Vu Duc; Kim, Kap-Hwan;
  PDF(new window)
 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
Dual Cycling;Ship Operation Schedule;Container Terminal;and Simulation;
 Language
English
 Cited by
1.
Dispatching Vehicles Considering Multi-lifts of Quay Cranes,;;

Industrial Engineering and Management Systems, 2010. vol.9. 2, pp.178-194 crossref(new window)
1.
Dispatching Vehicles Considering Multi-lifts of Quay Cranes, Industrial Engineering and Management Systems, 2010, 9, 2, 178  crossref(new windwow)
2.
Heuristic Algorithms for Constructing Transporter Pools in Container Terminals, IEEE Transactions on Intelligent Transportation Systems, 2013, 14, 2, 517  crossref(new windwow)
 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. crossref(new window)

2.
Briskorn, D., Drexl, A., and Hartmann, S. (2006), Inventory-based dispatching of automated guided vehicles on container terminals, OR Spectrum, 28, 611-630. crossref(new window)

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. crossref(new window)

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. crossref(new window)

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. crossref(new window)

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. crossref(new window)

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. crossref(new window)

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. crossref(new window)

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. crossref(new window)