Abstract
Railway container terminals, where gantry cranes are responsible for loading and unloading containers between freight trains and yards, are important hubs of hinterland logistics transportation. Terminal managers confront the challenge in improving the efficiency of their service. As the most expensive equipment in a terminal, the operational performance of gantry cranes is a crucial factor. In this paper, the gantry crane scheduling problem of railway container terminals is investigated. A mixed integer programming model which considers the effect of dwelling position dependent processing times is formulated. In addition, the safety distances, the travel times and the non-crossing requirement of cranes are incorporated in the mathematical model. A novel discrete artificial bee colony algorithm is presented to solve the intractable scheduling problem. Computational experiments are conducted to evaluate the proposed algorithm on some randomly constructed instances based on typical terminal operational data. Experimental results show that the proposed approach can obtain near optimal solutions for the investigated problem in a reasonable computational time.
Article PDF
Avoid common mistakes on your manuscript.
References
Ministry of Railway, China. Railway Statistical Bulletin. Retrieved May 1, 2012, http://www.china-mor.gov.cn/zwzc/tjxx/. (2012) (in Chinese).
M. Sammarra, J.-F. Cordeau, G. Laporte and M.F. Monaco, A tabu search heuristic for the quay crane scheduling problem, Journal of Scheduling. 10 (4–5) (2007) 327–336.
N. Boysen, F. Jarhn and E. Pesch, Scheduling freight trains in Rail-Rail transshipment yards, Transportation Science. 45 (2) (2011) 199–211.
T. Benna and M. Gronalt, Generic Simulation for rail-road container Terminals. in Proceedings of Winter Simulation Conference. (Miami, FL, United states, 2008), pp. 2656–2660.
P. Guo, W. Cheng and M. Zhang, Simulation on the operation influence by external factors for railway container logistic center. in Proceeding of International Conference of Logistics Engineering and Management. (Chengdu, China, 2010), pp. 2915–2922.
E. Kozan, Optimising container transfers at multimodal terminals, Mathematical and Computer Modelling. 31 (10–12) (2000) 235–243.
P. Corry and E. Kozan, An assignment model for dynamic load planning of intermodal trains, Computers & Operations Research. 33 (1) (2006) 1–17.
B.J. Jeong and K.H. Kim, Scheduling operations of a rail crane and container deliveries between rail and port terminals, Engineering Optimization. 43 (6) (2011) 597–613.
C. Bierwirth and F. Meisel, A survey of berth allocation and quay crane scheduling problems in container terminals, European Journal of Operational Research. 202 (3) (2010) 615–627.
C.F. Daganzo, The crane scheduling problem, Transportation Research Part B: Methodological. 23 (3) (1989) 159–175.
R.I. Peterkofsky and C.F. Daganzo, A branch and bound solution method for the crane scheduling problem, Transportation Research Part B: Methodological. 24 (3) (1990) 159–172.
A. Lim, B. Rodrigues, F. Xiao and Y. Zhu, Crane scheduling with spatial constraints, Naval Research Logistics. 51 (3) (2004) 386–406.
K.H. Kim and Y.-M. Park, A crane scheduling method for port container terminals, European Journal of Operational Research. 156 (3) (2004) 752–768.
L. Moccia, J.-F. Cordeau, M. Gaudioso and G. Laporte, A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal, Naval Research Logistics. 53 (1) (2006) 45–59.
W.C. Ng and K.L. Mak, Quay crane scheduling in container terminals, Engineering Optimization. 38 (6) (2006) 723–737.
C. Bierwirth and F. Meisel, A fast heuristic for quay crane scheduling with interference constraints, Journal of Scheduling. 12 (4) (2009) 345–360.
Y. Zhu and A. Lim, Crane scheduling with non-crossing constraint, Journal of the Operational Research Society. 57 (12) (2006) 1464–1471.
A. Lim, B. Rodrigues and Z. Xu, A m-parallel crane scheduling problem with a non-crossing constraint, Naval Research Logistics. 54 (2) (2007) 115–127.
D.-H. Lee, H.Q. Wang and L. Miao, Quay crane scheduling with non-interference constraints in port container terminals, Transportation Research Part E: Logistics and Transportation Review. 44 (1) (2008) 124–135.
D.-H. Lee, H.Q. Wang and L. Miao, Quay crane scheduling with handling priority in port container terminals, Engineering Optimization. 40 (2) (2008) 179–189.
D.-H. Lee and H.Q. Wang, An approximation algorithm for quay crane scheduling with handling priority in port container terminals, Engineering Optimization. 42 (12) (2010) 1151–1161.
P. Legato, R. Trunfio and F. Meisel, Modeling and solving rich quay crane scheduling problems, Computers & Operations Research. 39 (9) (2012) 2063–2078.
Y.M. Park and K.H. Kim, A scheduling method for berth and quay cranes, OR Spectrum. 25 (1) (2003) 1–23.
F. Meisel and C. Bierwirth, Heuristics for the integration of crane productivity in the berth allocation problem, Transportation Research Part E: Logistics and Transportation Review. 45 (1) (2009) 196–209.
C. Zhang, L. Zheng, Z. Zhang, L. Shi and A.J. Armstrong, The allocation of berths and quay cranes by using a sub-gradient optimization technique, Computers and Industrial Engineering. 58 (1) (2010) 40–50.
B. Raa, W. Dullaert and R.V. Schaeren, An enriched model for the integrated berth allocation and quay crane assignment problem, Expert Systems with Applications. 38 (11) (2011) 14136–14147.
C. Liang, Y. Huang and Y. Yang, A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning, Computers and Industrial Engineering. 56 (3) (2009) 1021–1028.
D.-H. Lee and H. Qiu Wang, Integrated discrete berth allocation and quay crane scheduling in port container terminals, Engineering Optimization. 42 (8) (2010) 747–761.
D. Karaboga, An Idea Based on Honey Bee Swarm for Numerical Optimization, in: Technical Report TR06, Computer Engineering Department, Erciyes University, Kayseri, Turkey, 2005.
D. Karaboga and B. Basturk, A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm, Journal of Global Optimization. 39 (3) (2007) 459–471.
D. Karaboga and B. Basturk, On the performance of artificial bee colony (ABC) algorithm, Applied Soft Computing. 8 (1) (2008) 687–697.
D. Karaboga and B. Akay, A comparative study of artificial bee colony algorithm, Applied Mathematics and Computation. 214 (1) (2009) 108–132.
J.-Q. Li, Q.-K. Pan and K.-Z. Gao, Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems, International Journal of Advanced Manufacturing Technology. 55 (9–12) (2011) 1159–1169.
Q.-K. Pan, M. Fatih Tasgetiren, P.N. Suganthan and T.J. Chua, A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem, Information Sciences. 181 (12) (2011) 2455–2468.
W.Y. Szeto, Y. Wu and S.C. Ho, An artificial bee colony algorithm for the capacitated vehicle routing problem, European Journal of Operational Research. 215 (1) (2011) 126–135.
M.F. Tasgetiren, Q.-K. Pan, P.N. Suganthan and A.H.L. Chen, A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops, Information Sciences. 181 (16) (2011) 3459–3475.
Q. Niu, B. Jiao and X. Gu, Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time, Applied Mathematics and Computation. 205 (1) (2008) 148–158.
A.H. Kashan and B. Karimi, A discrete particle swarm optimization algorithm for scheduling parallel machines, Computers and Industrial Engineering. 56 (1) (2009) 216–223.
J. Kennedy and R. Eberhart, Particle swarm optimization. in Proceeding of IEEE International Conference on Neural Networks. (Perth, Australia, 1995), pp. 1942–1948.
R. Ruiz and T. Stutzle, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research. 177 (3) (2007) 2033–2049.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
About this article
Cite this article
Guo, P., Cheng, W., Zhang, Z. et al. Gantry Crane Scheduling with Interference Constraints in Railway Container Terminals. Int J Comput Intell Syst 6, 244–260 (2013). https://doi.org/10.1080/18756891.2013.768444
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1080/18756891.2013.768444