화물열차의 컨테이너 할당 위치 결정에 관한 연구

초록

This paper deals with the container assignment problem on the freight train. The problem can be defined as determining the position of containers on the freight train while minimizing the order completion time of logistics firms. Since the productivity of rail freight terminal depends on the efficiency of rail crane operations, the sequential loading operation to minimize makespan is much more efficient than the batch loading operation in terms of logistic firms. However, the batch loading operations may increase the service level of logistics firms due to decreasing the range of order completion time. The objective of this paper is to establish the container assignment plan to minimize the range of order completion time of logistics firms subject to minimizing makespan of rail crane. The problem is formulated as a mixed integer program.