철도-육상트럭 환적지에서의 입주사 작업시간을 고려한 크레인 적하작업 스케줄링 : 의왕ICD 사례
Crane Scheduling Considering Tenant Service Time in a Rail-Road Transshipment Yard : Case of the Uiwang ICD
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (14)
- Bierwirth, C., "A fast heuristic for quay crane scheduling with interference constraints", Journal of Scheduling, 12(4), pp.345~360 (2009)
- Bostel, N., "Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard", Transportation Science, 32(4), pp.370~379 (1998)
- Boysen, N., "Determining crane areas in intermodal transshipment yards : The yard partition problem", European Journal of Operational Research, 204(2), pp.336~342 (2010)
- Heshmati, S., "An Agent-based Approach to Schedule Crane Operations in Rail-rail Transshipment Terminals, In Computational Management Science", Lecture notes in Economics and Mathematical Systems, 682, pp.91~97 (2016)
- Holland, J, "Adaptation in natural and artificial systems" (1975), The University of Michigan Press
- Kim, K.H., "A crane scheduling method for port container terminals", European Journal of Operational Research, 156(3), pp.752~768 (2004)
- 김광태, "철송 크레인 일정계획 문제에 대한 메타 휴리스틱", 산업공학(IE interfaces), 24(4), pp.281~294 (2011), 대한산업공학회
- Kozan, E., "Optimizing container transfers at multimodal terminals", Mathematical and Computer Modeling, 31(10-12), pp.235~243 (2000)
- 이명호, "물류 서비스 향상을 위한 배차계획 시스템의 설계 및 구현", 한국산학기술학회논문지, 7(4), pp.587~593 (2006), 한국산학기술학회
- Moccia, L., "A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal", Naval Research Logistics, 53(1), pp.45~59 (2006)
- Development of Support Measure for Increasing Rail Freight, "Moon, J.S.", The Korea transportation institute, ~ (2007)
- Sammarra, M., "A tabu search heuristic for the quay crane scheduling problem", Journal of Scheduling, 10(4-5), pp.327~336 (2007)
- Song, C.Y., "A heuristic for part sequencing on a flexible machine", Journal of Society of Korea Industrial and Systems Engineering, 22(52), pp.81~85
- Souffriau, W., "Metaheuristics in the Service Industry, Lecture Notes in Economics and Mathematical Systems, Vol. 624", pp.83~98 (2009)