Terminal appointment system design by non-stationary M(t)/Ek/c(t) queueing model and genetic algorithm

被引:79
作者
Chen, Gang [1 ,2 ]
Govindan, Kannan [3 ]
Yang, Zhong-Zhen [1 ]
Choi, Tsan-Ming [4 ]
Jiang, Liping [5 ]
机构
[1] Dalian Maritime Univ, Transport Planning Inst, Dalian 116023, Liaoning Provin, Peoples R China
[2] Aalborg Univ, Dept Mech & Mfg Engn, DK-2450 Copenhagen, Denmark
[3] Univ Southern Denmark, Dept Econ & Business, Odense, Denmark
[4] Hong Kong Polytech Univ, Business Div, Inst Text & Clothing, Kowloon, Hong Kong, Peoples R China
[5] Univ Southern Denmark, Inst Technol & Innovat, DK-5230 Odense M, Denmark
关键词
Container terminal; Non-stationary queue; Appointment system; Dynamic arrival management; Optimisation; SUPPLY CHAIN; CONTAINER TERMINALS; TRUCK ARRIVALS; DRAYAGE OPERATIONS; SCHEDULING PROBLEM; SERVICE-LEVEL; APPROXIMATION; QUEUES; TIME; OPTIMIZATION;
D O I
10.1016/j.ijpe.2013.09.001
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Long truck queue is a common problem at big marine container terminals, where the resources and equipment are usually scheduled to serve ships prior to trucks. To reduce truck queues, some container terminals adopt terminal appointment system (TAS) to manage truck arrivals. This paper addresses two implementation scenarios of TAS: static TAS (STAS) and dynamic TAS (DTAS). First, a non-stationary M(t)/E-k/c(t) queueing model is used to analyse a terminal gate system, and solved with a new approximation approach. Then, genetic algorithm is applied to optimise the hourly quota of entry appointments in STAS for the derived queueing model. Lastly to relax the assumption of knowing the truckers' preferred arrival pattern in STAS, we propose the concept of DTAS, which is much easier to apply and can assist individual trucker in making appointment by providing real-time estimation of waiting time based on existing appointments. Our analysis reveals DTAS can significantly increase the system flexibility. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:694 / 703
页数:10
相关论文
共 33 条
[1]  
[Anonymous], 2006, COOPERATIVE TIME WIN
[2]   A block mining and re-combination enhanced genetic algorithm for the permutation flowshop scheduling problem [J].
Chang, Pei-Chann ;
Huang, Wei-Hsiu ;
Wu, Jheng-Long ;
Cheng, T. C. E. .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) :45-55
[3]   A genetic algorithm for solving a fuzzy economic lot-size scheduling problem [J].
Chang, PT ;
Yao, MJ ;
Huang, SF ;
Chen, CT .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 102 (02) :265-288
[4]   Managing truck arrivals with time windows to alleviate gate congestion at container terminals [J].
Chen, Gang ;
Govindan, Kannan ;
Yang, Zhongzhen .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) :179-188
[5]   Using time-varying tolls to optimize truck arrivals at ports [J].
Chen, Xiaoming ;
Zhou, Xuesong ;
List, George F. .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2011, 47 (06) :965-982
[6]   SOME APPROXIMATE EQUILIBRIUM RESULTS FOR MULTI-SERVER QUEUE (M-G-R) [J].
COSMETATOS, GP .
OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (03) :615-620
[7]   Approximate solution for multi-server queueing systems with Erlangian service times [J].
Escobar, M ;
Odoni, AR ;
Roth, E .
COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (10) :1353-1374
[8]   A genetic algorithm to optimize the total cost and service level for just-in-time distribution in a supply chain [J].
Farahani, Reza Zanjirani ;
Elahipanah, Mahsa .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 111 (02) :229-243
[9]   Reducing port-related truck emissions: The terminal gate appointment system at the Ports of Los Angeles and Long Beach [J].
Giuliano, Genevieve ;
O'Brien, Thomas .
TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2007, 12 (07) :460-473
[10]   THE POINTWISE STATIONARY APPROXIMATION FOR QUEUES WITH NONSTATIONARY ARRIVALS [J].
GREEN, L ;
KOLESAR, P .
MANAGEMENT SCIENCE, 1991, 37 (01) :84-97