Browse > Article
http://dx.doi.org/10.11627/jkise.2018.41.4.238

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

Kim, Kwang-Tae (School of Industrial Management Engineering, Korea University, Entrue Consulting, LG CNS)
Kim, Hyo-Jeong (Hi-Tech Business Division, LG CNS)
Son, Dong-Hoon (Graduate School of Logistics, Inha University)
Jang, Jin-Myeong (Graduate School of Logistics, Inha University)
Kim, Hwa-Joong (Graduate School of Logistics, Inha University)
Publication Information
Journal of Korean Society of Industrial and Systems Engineering / v.41, no.4, 2018 , pp. 238-247 More about this Journal
Abstract
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.
Keywords
Railway Transportation; Rail-Road Transshipment Yard; Crane Scheduling; Tenant Service Time;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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.   DOI
2 Moon, J.S. and Lee, J.M., Development of Support Measure for Increasing Rail Freight, The Korea transportation institute, 2007.
3 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.   DOI
4 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.
5 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.
6 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.   DOI
7 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.   DOI
8 Holland, J., Adaptation in natural and artificial systems, Ann Arbour : The University of Michigan Press, 1975.
9 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.   DOI
10 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.
11 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.   DOI
12 Kim, K.T. and Kim, K.M., Metaheuristics of the rail crane scheduling problem, IE Interfaces, 2011, Vol. 24, No. 4, pp. 281-294.   DOI
13 Kozan, E., Optimizing container transfers at multimodal terminals, Mathematical and Computer Modeling, 2000, Vol. 31, No. 10-12, pp. 235-243.   DOI
14 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.