산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)

  • 제41권4호
  • /
  • Pages.238-247
  • /
  • 2018
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지
DOI QR코드

DOI QR Code

철도-육상트럭 환적지에서의 입주사 작업시간을 고려한 크레인 적하작업 스케줄링 : 의왕ICD 사례

Crane Scheduling Considering Tenant Service Time in a Rail-Road Transshipment Yard : Case of the Uiwang ICD

  • 김광태 (고려대학교 산업경영공학부, LG CNS Entrue컨설팅) ;
  • 김효정 (LG CNS 하이테크사업부) ;
  • 손동훈 (인하대학교 물류전문대학원) ;
  • 장진명 (인하대학교 물류전문대학원) ;
  • 김화중 (인하대학교 물류전문대학원)
  • 투고 : 2018.11.12
  • 심사 : 2018.12.24
  • 발행 : 2018.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper considers the problem of scheduling loading and unloading operations of a crane in a railway terminal motivated from rail-road container transshipment operations at Uiwang Inland Container Depot (ICD). Unlike previous studies only considering the total handling time of containers, this paper considers a bi-criteria objective of minimizing the weighted sum of the total handling time and tenant service time. The tenant service time is an important criterion in terms of terminal tenants who are private logistics companies in charge of moving containers from/to the terminal using their trucks. In the rail-road container shipment yard, the tenant service time of a tenant can be defined by a time difference between beginning and finishing loading and unloading operations of a crane. Thus, finding a set of sequences and time of the crane operations becomes a crucial decision issue in the problem. The problem is formulated as a nonlinear program which is improved by linearizing a nonlinear constraint in the model. This paper develops a genetic algorithm to solve the problem and performs a case study on the Uiwang ICD terminal. Computational experiment results show that the genetic algorithm shows better performance than commercial optimization solvers. Operational implications in terms of tenants are drawn through sensitivity analyses.

키워드

참고문헌

  1. Bierwirth, C. and Meisel, F., A fast heuristic for quay crane scheduling with interference constraints, Journal of Scheduling, 2009, Vol. 12, No. 4, pp. 345-360. https://doi.org/10.1007/s10951-009-0105-0
  2. Bostel, N. and Dejax, P., Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard, Transportation Science, 1998, Vol. 32, No. 4, pp. 370-379. https://doi.org/10.1287/trsc.32.4.370
  3. Boysen, N. and Fliedner, M., Determining crane areas in intermodal transshipment yards : The yard partition problem, European Journal of Operational Research, 2010, Vol. 204, No. 2, pp. 336-342. https://doi.org/10.1016/j.ejor.2009.10.031
  4. Heshmati, S., Kokkinogenis, Z., Rossetti, R., Carravilla, M., and Oliveira, J., An Agent-based Approach to Schedule Crane Operations in Rail-rail Transshipment Terminals, In Computational Management Science, Lecture notes in Economics and Mathematical Systems, 2016, Vol. 682, pp. 91-97.
  5. Holland, J., Adaptation in natural and artificial systems, Ann Arbour : The University of Michigan Press, 1975.
  6. Kim, K.H. and Park, Y.M., A crane scheduling method for port container terminals, European Journal of Operational Research, 2004, Vol. 156, No. 3, pp. 752-768. https://doi.org/10.1016/S0377-2217(03)00133-4
  7. Kim, K.T. and Kim, K.M., Metaheuristics of the rail crane scheduling problem, IE Interfaces, 2011, Vol. 24, No. 4, pp. 281-294. https://doi.org/10.7232/IEIF.2011.24.4.281
  8. Kozan, E., Optimizing container transfers at multimodal terminals, Mathematical and Computer Modeling, 2000, Vol. 31, No. 10-12, pp. 235-243. https://doi.org/10.1016/S0895-7177(00)00092-3
  9. Lee, M.H., Design and implication of vehicle delivery planning system for the improvement logistics services, Journal of the Korea Academia-Industrial cooperation Society, 2006, Vol. 7, No. 4, pp. 587-593.
  10. Moccia, L., Cordeau, J.F., Gaudioso, M. and Laporte, C., A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal, Naval Research Logistics, 2006, Vol. 53, No. 1, pp. 45-59. https://doi.org/10.1002/nav.20121
  11. Moon, J.S. and Lee, J.M., Development of Support Measure for Increasing Rail Freight, The Korea transportation institute, 2007.
  12. Sammarra, M., Cordeau, J.F., Laporte, G. and Monaco, M.F., A tabu search heuristic for the quay crane scheduling problem, Journal of Scheduling, 2007, Vol. 10, No. 4-5, pp. 327-336. https://doi.org/10.1007/s10951-007-0029-5
  13. Song, C.Y., A heuristic for part sequencing on a flexible machine, Journal of Society of Korea Industrial and Systems Engineering, Vol. 22, No. 52, pp, 81-85.
  14. Souffriau, W., Vansteenwegen, P., van den Berghe, G. and van Oudheusden, D., Variable Neighbourhood Descent for Planning Crane Operations in a Train Terminal, Sorensen, K., Sevaux, M., Habenicht, W., Geiger, M.J, eds., Metaheuristics in the Service Industry, Lecture Notes in Economics and Mathematical Systems, 2009, Vol. 624, pp. 83-98.