IE interfaces (산업공학)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

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)
  • 김광태 (한국철도기술연구원 녹색교통물류연구본부 교통시스템효율화연구단) ;
  • 김경민 (한국철도기술연구원 녹색교통물류연구본부 교통시스템효율화연구단)
  • Received : 2011.06.13
  • Accepted : 2011.09.22
  • Published : 2011.12.01
Download PDF
⟨ Previous Next ⟩

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

References

  1. 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.
  2. 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. https://doi.org/10.1016/j.ejor.2009.05.031
  3. 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. https://doi.org/10.1287/trsc.32.4.370
  4. 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.
  5. Glover, F. (1989), Tabu seacrh-Part I, ORSA Journal on Computing, 1(3), 190-206. https://doi.org/10.1287/ijoc.1.3.190
  6. Glover, F. (1990), Tabu seacrh-Part II, ORSA Journal on Computing, 2(1), 4-32. https://doi.org/10.1287/ijoc.2.1.4
  7. Holland, J. (1975), Adaptation in Natural and Artificial Systems, The university of Michigan Press, Ann Arbour.
  8. 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. https://doi.org/10.1080/0305215X.2010.502936
  9. 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 https://doi.org/10.1007/s10845-005-0020-y
  10. Kim, K. H. and Park, Y. M. (2004), A crane scheduling method for container terminals, European Journal of Operational Research, 156(3), 752-768. https://doi.org/10.1016/S0377-2217(03)00133-4
  11. Kim, Y. K., Yun B. S., and Lee, S. B. (1999), Metaheuristic, Yeongji Moonhwasa, Seoul, Korea.
  12. Kirkpatrick, S. H., Gelatt, C. D., and Vecchi, M. P. (1983), Optimization by simulated annealing, Science, 220(4598), 671-679. https://doi.org/10.1126/science.220.4598.671
  13. Kozan, E. (2000), Optimizing container transfers at multimodal terminals, Mathematical and Computer Modeling, 31(10-12), 235-243. https://doi.org/10.1016/S0895-7177(00)00092-3
  14. 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. https://doi.org/10.1016/j.tre.2006.08.001
  15. 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.
  16. 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.
  17. 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.
  18. Ng, W. C. and Mak, K. L. (2005b), Yard crane scheduling in port container terminals, Applied Mathematical Modelling, 29(3), 263-276. https://doi.org/10.1016/j.apm.2004.09.009
  19. 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.
  20. Zhu, Y. and Lim, A. (2006), Crane scheudling with non-crossing constraint, Journal of the Operational Research Society, 57(12), 1464-1471. https://doi.org/10.1057/palgrave.jors.2602110

Cited by

  1. Crane Scheduling Considering Tenant Service Time in a Rail-Road Transshipment Yard : Case of the Uiwang ICD vol.41, pp.4, 2018, https://doi.org/10.11627/jkise.2018.41.4.238