曹瑾鑫;史其信;Der-Horng Lee;

• 1:Department of Civil Engineering
• 2: Tsinghua University
• 3:Department of Transportation Engineering
• 4: Inner Mongolia University

摘要(Abstract)：

Quay crane and yard truck scheduling are two important subproblems in container terminal opera-tions which have been studied separately in previous research. This paper proposes a new problem for the integrated quay crane and yard truck scheduling for inbound containers. The problem is formulated as a mixed integer programming (MIP) model. Due to the intractability, a genetic algorithm (GA) and a modified Johnson’s Rule-based heuristic algorithm (MJRHA) are used for the problem solution. In addition, two closed form lower bounds are given to evaluate the solution accuracy. Computational experiments show that the solution algorithm can efficiently handle the scheduling problem and that the integrated methods are very useful.

关键词(KeyWords)：

Abstract:

Keywords:

基金项目(Foundation):

作者(Authors): 曹瑾鑫;史其信;Der-Horng Lee;

参考文献(References)：

• [1] Port of hamburger. http://www.hafen-hamburg.de/content/ view/31/33/lang,en/, 2008.
• [2] Stahlbock R, Voff S. Operations research at container ter- minals: A literature update. OR Spectrum, 2008, 30: 1-52.
• [3] Ng W C. Crane scheduling in container yards with in- ter-crane interference. European Journal of Operational Research, 2005, 164: 64-78.
• [4] Daganzo C F. The crane scheduling problem. Transporta- tion Research, 1989, 23B(3): 159-175.
• [5] Peterkofsky R I, Daganzo C F. A branch and bound solu- tion method for the crane scheduling problem. Transporta- tion Research, 1990, 24B(3): 159-172.
• [6] Kim K H, Park Y M. A crane scheduling method for port container terminals. European Journal of Operational Re- search, 2004, 156: 752-768.
• [7] Vis I F A, de Koster R M B M, Savelsbergh M W P. Mini- mum vehicle fleet size under time-window constraints at a container terminal. Transportation Science, 2005, 39(2): 249-260.
• [8] Bish E K, Chen F Y, Leong Y T, et al. Dispatching vehicles in a mega container terminal. OR Spectrum, 2005, 27: 491-506.
• [9] Kim K H, Bae J W. A look-ahead dispatching method for automated guided vehicles in automated port container terminals. Transportation Science, 2004, 38(2): 224-234.
• [10] Ng W C, Mak K L, Zhang Y X. Scheduling trucks in con- tainer terminals using a genetic algorithm. Engineering Optimization, 2007, 39(1): 33-47.
• [11] Holland J H. Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press, 1975.
• [12] Goldberg D. Genetic Algorithms in Search, Optimization and Machine Leaning. MA: Addison-Wesley, 1989.
• [13] Chen Y, Leong T, Ng W C, et al. Dispatching vehicles in a mega container terminal. Working paper, Northwestern University, Evanston, IL, 1998.
• [14] Gen M, Cheng R. Genetic Algorithms and Engineering Design. Singapore: John Wiley, 1996.
• [15] Johnson S M. Optimal two- and three-stage production schedules with setup time included. Naval Research Logis- tics Quarterly, 1954, 1: 61-67.