Abstract

Electric multiple unit (EMU) trains’ high-level maintenance planning is a discrete problem in mathematics. The high-level maintenance process of the EMU trains consumes plenty of time. When the process is undertaken during peak periods of the passenger flow, the transportation demand may not be fully satisfied due to the insufficient supply of trains. In contrast, if the process is undergone in advance, extra costs will be incurred. Based on the practical requirements of high-level maintenance, a 0–1 programming model is proposed. To simplify the description of the model, candidate sets of delivery dates, i.e., time windows, are generated according to the historical data and maintenance regulations. The constraints of the model include maintenance regulations, the passenger transportation demand, and capacities of workshop. The objective function is to minimize the mileage losses of all EMU trains. Moreover, a modified particle swarm algorithm is developed for solving the problem. Finally, a real-world case study of Shanghai Railway is conducted to demonstrate the proposed method. Computational results indicate that the (approximate) optimal solution can be obtained successfully by our method and the proposed method significantly reduces the solution time to 500 s.

Highlights

  • In China, high-speed railway has become a priority option for the long trip due to its convenience and comfortableness, and it account for 60% of rail total passenger traffic

  • We present a modified particle swarm optimization (MPSO) algorithm to solve the high-level maintenance maintenance plan plan (HMP) model based on analysis and preprocess

  • It is a crucial step to make the particle of the MPSO and the solution of a certain problem correspond with each other

Read more

Summary

Introduction

In China, high-speed railway has become a priority option for the long trip due to its convenience and comfortableness, and it account for 60% of rail total passenger traffic. It has long been a difficult problem for the China Railway (CR) that supply enough available Electric Multiple Unit (EMU) trains in tourist rush seasons to fulfill heavy transportation tasks. The EMU trains are the unique vehicles running on the China high-speed railway. They have a high purchase cost and complicated maintenance regulations.

The operation and and maintenance maintenance
HMP Problem at CR
Mathematical Model of the HMP Problem
Notations
Constraints Analysis
Model Construction
Modified Particle Swarm Optimization Algorithm
Processing of Model Constraints
General Particle Swarm Optimization Algorithm
Inertia Weight
Learning Factor
Update Equations
Encoding Rules and Initial Solution
Algorithm
Calculate
Update
Case Study
Findings
Conclusions
Full Text
Published version (Free)

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