Gantry Crane Scheduling with Interference Constraints in Railway Container Terminals
- 10.1080/18756891.2013.768444How to use a DOI?
- Railway container terminal, Gantry crane scheduling, Interference constraint, Artificial bee colony algorithm
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.
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - JOUR AU - Peng Guo AU - Wenming Cheng AU - Zeqiang Zhang AU - Min Zhang AU - Jian Liang PY - 2013 DA - 2013/03/01 TI - Gantry Crane Scheduling with Interference Constraints in Railway Container Terminals JO - International Journal of Computational Intelligence Systems SP - 244 EP - 260 VL - 6 IS - 2 SN - 1875-6883 UR - https://doi.org/10.1080/18756891.2013.768444 DO - 10.1080/18756891.2013.768444 ID - Guo2013 ER -