A heuristic approach to integrate train timetabling, platforming, and railway network maintenance scheduling decisions

Train timetabling, platforming, and network maintenance scheduling are three highly interdependent problems that crucial in the planning of railway operations, each is normally addressed separately. In this paper, we simultaneously optimize these for a high-speed comprised multiple lines stations. We model on mesoscopic level formulate 0–1 binary integer programming minimizes total train weighted running cost any deviation from ideal task start times. A heuristic procedure, which dynamically updates available time windows trains, used to control number paths mathematical model. The repeatedly solved, at iteration gradually modify set available. Four different strategies path modification step their selection depends solution Computational results networks sizes conclusively demonstrate there not only benefit integrating problems, with improvements as much 30%, but also proposed approach effective. Compared commercial solver CPLEX, able more quickly find better quality solutions within given limit.