Algorithm for Electric Multiple Unit Scheduling Based on High-Speed Railway Network

Abstract

The scheduling problem of electric multiple units (EMU) is one of the key technologies in high-speed railway organization. A reasonable amount of railway equipment is required to maximize the economic benefits of investment in high-speed railway. High-speed EMUs are the most important mobile devices to complete the high-speed transportation tasks, which take a large proportion of railway devices investment. Adopting a reasonable transportation organization plan to increase EMU service efficiency and reduce the procurement amount is an efficient way to decrease high-speed investment and operation costs as well as improve its economic efficiency. Based on the periodicity feature of EMU scheduling, a multi-base, multi-type EMU comprehensive scheduling model for high-speed railway network is presented. The EMU scheduling is processed through computer simulation technology. Meanwhile, by using the ideas and strategies of greedy algorithm, backtracking algorithm and genetic algorithm, the model is solved and optimized. Taking high-speed rail as the simulation example, an EMU scheduling plan and EMU configuration amount is proposed, providing some valuable research results for the comprehensive operation and maintenance management of the EMU on high-speed railway.