Optimizing Electric Multiple Unit Circulation Plan within Maintenance Constraints for High-Speed Railway System

TL;DR

This paper presents a 0-1 integer programming model and a particle swarm optimization heuristic to optimize EMU circulation plans in high-speed railways, balancing connection time, mileage, and maintenance constraints.

Contribution

It introduces a novel optimization model for EMU circulation planning and an efficient heuristic algorithm to solve large-scale problems.

Findings

The model effectively balances connection time and mileage.

The heuristic algorithm improves solution efficiency for large problems.

The approach accommodates maintenance constraints in planning.

Abstract

The Electric Multiple Unit (EMU) circulation plan is the foundation of EMU assignment and maintenance planning,and its primary task is to determine the connections of trains in terms of train timetable and maintenance constraints. We study the problem of optimizing EMU circulation plan, and a 0-1 integer programming model is presented on the basis of train connection network design. The model aims at minimizing the total connection time of trains and maximizing the travel mileage of each EMU circulation, and it meets the maintenance constraints from two aspects of mileage and time cycle. To solve a large-scale problem efficiently, we present a heuristic algorithm based on particle swarm optimization algorithm. At last, we conclude the contributions and directions of future research.