Abstract

With the rapid development of high-speed railway in China, the problem of motor train set assignment and maintenance scheduling is becoming more and more important for transportation organization. This paper focuses on considering the special maintenance items of motor train set and mainly meets the two maintenance cycle limits on aspects of mileage and time for each item. And then, a 0-1 integer programming model for motor train set assignment and maintenance scheduling is proposed, which aims at maximizing the accumulated mileage before each maintenance and minimizing the number of motor train sets. Restrictions of the model include the matching relation between motor train sets and routes as well as that between motor train sets and maintenance items and maintenance capacity of motor train set depot. A heuristic solution strategy based on particle swarm optimization is also proposed to solve the model. In the end, a case study is designed based on the background of Beijing south depot in China, and the result indicates that the model and algorithm proposed in this paper could solve the problem of motor train set assignment and maintenance scheduling effectively.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call