Browse > Article
http://dx.doi.org/10.7232/IEIF.2011.24.4.281

Metaheuristics of the Rail Crane Scheduling Problem  

Kim, Kwang-Tae (Green Transport & Logistics Systems Research Center Transport Systems Efficiency Research Team Korea Railroad Research Institute)
Kim, Kyung-Min (Green Transport & Logistics Systems Research Center Transport Systems Efficiency Research Team Korea Railroad Research Institute)
Publication Information
IE interfaces / v.24, no.4, 2011 , pp. 281-294 More about this Journal
Abstract
This paper considers the rail crane scheduling problem which is defined as determining the sequence of loading/unloading container on/from a freight train. The objective is to minimize the weighted sum of the range of order completion time and makespan. The range of order completion time implies the difference between the maximum of completion time and minimum of start time of each customer order consisting of jobs. Makespan refers to the time when all the jobs are completed. In a rail freight terminal, logistics firms as a customer wish to reduce the range of their order completion time. To develop a methodology for the crane scheduling, we formulate the problem as a mixed integer program and develop three metaheuristics, namely, genetic algorithm, simulated annealing, and tabu search. To validate the effectiveness of heuristic algorithms, computational experiments are done based on a set of real life data. Results of the experiments show that heuristic algorithms give good solutions for small-size and large-size problems in terms of solution quality and computation time.
Keywords
rail crane scheduling; rail freight terminal; order completion time; metaheuristics;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 Kozan, E. (2000), Optimizing container transfers at multimodal terminals, Mathematical and Computer Modeling, 31(10-12), 235-243.   DOI   ScienceOn
2 Lee, D. H., Wang, H. Q., and Miao, L. (2008), Quay crane scheduling with non-interference constraints in port container terminals, Transportation Research Part E, 44(1), 124-135.   DOI   ScienceOn
3 Lee, D. H. and Wang, H. Q. (2010), An approximation algorithm for quay crane scheduling with handling priority in port container terminals, Engineering Economics, 42(12), 1151-1161.
4 Moccia, L., Cordeau, J. F., Gaudioso, M., and Laporte, G. (2006), A branchand- cut algorithm for the quay crane scheduling problem in a container terminal, Naval Research Logistics, 53(1), 45-59.
5 Ng, W. C. and Mak, K. L. (2005a), An effective heuristic for scheduling a yard crane to handle jobs with different ready times, Engineering Economics, 37(8), 867-877.
6 Ng, W. C. and Mak, K. L. (2005b), Yard crane scheduling in port container terminals, Applied Mathematical Modelling, 29(3), 263-276.   DOI   ScienceOn
7 Park, C. K. and Seo, J. Y. (2009), Genetic algorithm of the planar storage location assignment problem, Journal of the Korean Institute of Industrial Engineers, 35(2), 129-140.
8 Zhu, Y. and Lim, A. (2006), Crane scheudling with non-crossing constraint, Journal of the Operational Research Society, 57(12), 1464-1471.   DOI   ScienceOn
9 Bae, H. C., Park, K. C., Cha, B. C., and Moon, I. K. (2007), Scheduling of shipyard sub-assembly process using genetic algorithm, IE Interfaces, 20(1), 33-40.
10 Bierwirth, C. and Meisel, F. (2010), A survey of berth allocation and quay crane scheduling problems in container terminals, European Journal of Operational Research, 202(3), 615-627.   DOI   ScienceOn
11 Bostel, N. and Dejax, P. (1998), Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard, Transportation Science, 32(4), 370-379.   DOI
12 Cao, Z., Lee, D. H., and Meng, Q. (2008), Deployment strategies of doublerail- mounted gantry crane systems for loading outbound containers in container terminals, International Journal of Production Economics, 115(1), 867- 877.
13 Jeong, B. J. and Kim, K. H. (2011), Scheduling operations of a rail crane and container deliveries between rail and port terminals, Engineering Optimization, 43(6), 597-613.   DOI   ScienceOn
14 Glover, F. (1989), Tabu seacrh-Part I, ORSA Journal on Computing, 1(3), 190-206.   DOI
15 Glover, F. (1990), Tabu seacrh-Part II, ORSA Journal on Computing, 2(1), 4-32.   DOI
16 Holland, J. (1975), Adaptation in Natural and Artificial Systems, The university of Michigan Press, Ann Arbour.
17 Jung, S. H. and Kim, K. H. (2006), Load scheduling for multiple quay crane in port container terminal, Journal of Intelligent Manufacturing, 17(4), 479-492   DOI   ScienceOn
18 Kim, K. H. and Park, Y. M. (2004), A crane scheduling method for container terminals, European Journal of Operational Research, 156(3), 752-768.   DOI   ScienceOn
19 Kim, Y. K., Yun B. S., and Lee, S. B. (1999), Metaheuristic, Yeongji Moonhwasa, Seoul, Korea.
20 Kirkpatrick, S. H., Gelatt, C. D., and Vecchi, M. P. (1983), Optimization by simulated annealing, Science, 220(4598), 671-679.   DOI