American Society of Civil Engineers


A New Model for Solving Integrated Wagon-Flow Allocation and Shunting Locomotive Scheduling Problem at Railyard


by Yi Zhang, (Shenhua Xinzhun Railway Co., Ltd., Ordos, Inner Mongolia, China, P.O, Box:017000; and School of Transportation and Logistics, Southwest Jiaotong University, Chengdu, Sichuan, China, P.O, Box:610031. E-mail: shshzyi@sohu.com) and Jun Zhao, (School of Transportation and Logistics, Southwest Jiaotong University, Chengdu, Sichuan, China, P.O, Box:610031. E-mail: shshzyi@sohu.com, jun-zhao@home.swjtu.edu.cn)
Section: Rail Operation and Organization, pp. 877-882, (doi:  http://dx.doi.org/10.1061/41184(419)145)

     Access full text
     Purchase Subscription
     Permissions for Reuse  

Document type: Conference Proceeding Paper
Part of: ICTE 2011
Abstract: This paper presented the integrated wagon-flow allocation and shunting locomotive scheduling problem at railyard with one break-up and one make-up locomotives. The problem simultaneously determines the make-up of each departure train and the break-up(make-up) task for break-up(make-up) shunting locomotive such that each departure train satisfies the train make-up rules while the total weighted time for wagons staying idle at railyard is minimized. Based on the theory of single machine scheduling and resource allocation, a mixed integer linear programming model separating the original problem into break-up sub-problem, wagon-flow allocation sub-problem and make-up sub-problem was proposed. At last, the model was tested on a instance taken from the literature and compared with other approaches. The computational results validated the correctness in problem description and effectiveness on solution quality with more solution time of the proposed model.


ASCE Subject Headings:
Traffic flow
Scheduling
Rail transportation
Algorithms