Journal Article10.1016/J.TRB.2019.07.010
Microscopic optimization model and algorithm for integrating train timetabling and track maintenance task scheduling
96
TL;DR: The iterative algorithm outperforms a standard MILP solver and the first-place team of this competition in terms of both solution quality and time to deliver the new best-known solutions.
read more
Abstract: This paper addresses the problem of improving the integration between passenger timetabling and track maintenance scheduling. We propose a microscopic optimization model and an iterative algorithm for solving this problem efficiently. Block sections are considered as the basic microscopic elements for train movements in a railway network. A mixed-integer linear programming formulation is proposed for the integrated optimization problem in which train timing, sequencing and routing are the timetabling variables, while timing and sequencing of maintenance tasks are the track maintenance variables. The objective function is to minimize the total train travel time and the maintenance tardiness cost. The constraints proposed in this work address the practical specifications of the INFORMS RAS 2016 Problem Solving Competition (2016 PSC). In this context, the main decision variables are the entrance and exit times of the trains on each block section plus the start and end times of each maintenance task. Since the integrated optimization problem is strongly NP-hard, an iterative algorithm is proposed to compute near-optimal solutions in a short computation time. The algorithm is based on a decomposition of the overall problem into sub-problems related to train scheduling and/or routing with or without track maintenance task scheduling. The connecting information between the two sub-problems concerns the selected train routes plus the start and end times of the maintenance tasks. Computational experiments are performed on a set of realistic railway instances, which were introduced during the 2016 PSC. The iterative algorithm outperforms a standard MILP solver and the first-place team of this competition in terms of both solution quality and time to deliver the new best-known solutions. The scalability of the iterative algorithm is investigated when increasing the number of trains and track maintenance tasks.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Timetable coordination in a rail transit network with time-dependent passenger demand
TL;DR: The computational results illustrate that the proposed approaches reduce the level of crowdedness of metro stations by around 8% in comparison with the current practical timetable of the investigated Beijing urban rail network.
142
Joint optimization of train scheduling and maintenance planning in a railway network: A heuristic algorithm using Lagrangian relaxation
TL;DR: A joint optimization model for the two problems in a railway network with double-track, where the upstream and downstream trains are independent and a maintenance task on a section cannot be split or disrupted is proposed.
104
Real-time integrated train rescheduling and rolling stock circulation planning for a metro line under disruptions
TL;DR: This paper studies an integrated train rescheduling and rolling stock circulation planning problem for the complete blockage situations in a metro line and proposes a heuristic technique that is based on introducing a new set of constraints to reduce the search space without eliminating potentially good solutions.
58
Vehicle dispatching in modular transit networks: A mixed-integer nonlinear programming model
TL;DR: A mixed-integer nonlinear programming model is developed to balance the tradeoff between the vehicle operation cost and the passenger trip time cost and this reformulated linear model can be solved with off-the-shelf commercial solvers.
54
An exact method for the integrated optimization of subway lines operation strategies with asymmetric passenger demand and operating costs
TL;DR: This study formulates an asymmetric operation strategy as an integrated mixed-integer non-linear model to optimize the entire operational process of rolling stock from the perspective of service quality and operating costs.
References
•Book
Multicriteria Optimization
Matthias Ehrgott
- 18 May 2005
TL;DR: This paper presents a meta-modelling framework for estimating the modeled solutions for various types of optimization problems in the multicriteria setting.
2.4K
A Survey of Optimization Models for Train Routing and Scheduling
TL;DR: A survey of recent optimization models for the most commonly studied rail transportation problems is presented and a classification of models is proposed and their important characteristics are described by focusing on model structure and algorithmic aspects.
842
A branch and bound algorithm for scheduling trains in a railway network
TL;DR: A branch and bound algorithm which includes implication rules enabling to speed up the computation of a train scheduling problem faced by railway infrastructure managers during real-time traffic control is developed.
663