Train Timetable Design for Shared Railway Systems using a Linear Programming Approach to Approximate Dynamic Programming
In the last 15 years, the use of rail infrastructure by different train operating companies (shared railway system) has been proposed as a way to improve infrastructure utilization and to increase efficiency in the railway industry. Shared use requires coordination between the infrastructure manager...
| Main Authors: | , , |
|---|---|
| Format: | Working Paper |
| Language: | en_US |
| Published: |
Massachusetts Institute of Technology. Engineering Systems Division
2016
|
| Online Access: | http://hdl.handle.net/1721.1/103005 |
| _version_ | 1826189904893181952 |
|---|---|
| author | Pena-Alcaraz, Maite Webster, Mort Ramos, Andres |
| author_facet | Pena-Alcaraz, Maite Webster, Mort Ramos, Andres |
| author_sort | Pena-Alcaraz, Maite |
| collection | MIT |
| description | In the last 15 years, the use of rail infrastructure by different train operating companies (shared railway system) has been proposed as a way to improve infrastructure utilization and to increase efficiency in the railway industry. Shared use requires coordination between the infrastructure manager and multiple train operators in a competitive framework, so that regulators must design appropriate capacity pricing and allocation mechanisms. However, the resulting capacity utilization from a given mechanism in the railway industry cannot be known in the absence of operations. Therefore assessment of capacity requires the determination of the train timetable, which eliminates any potential conflicts in bids from the operators. Although there is a broad literature that proposes train timetabling methods for railway systems with single operators, there are few models for shared competitive railway systems. This paper proposes a train timetabling model for shared railway systems that explicitly considers network effects and the existence of multiple operators requesting to operate several types of trains traveling along different routes in the network. The model is formulated and solved both as a mixed integer linear programming (MILP) problem (using a commercial solver) and as a dynamic programming (DP) problem. We solve the DP formulation with a novel algorithm based on a linear programming (LP) approach to approximate dynamic programming (ADP) that can solve much larger problems than are computationally intractable with commercial MILP solvers. The model simulates the optimal decisions by an infrastructure manager for a shared railway system with respect to a given objective function and safety constraints. This model can be used to evaluate alternative capacity pricing and allocation mechanism. We demonstrate the method for one possible capacity pricing and allocation mechanism, and show how the competing demands and the decisions of the infrastructure manager under this mechanism impact the operations on a shared railway system for all stakeholders. |
| first_indexed | 2024-09-23T08:28:50Z |
| format | Working Paper |
| id | mit-1721.1/103005 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T08:28:50Z |
| publishDate | 2016 |
| publisher | Massachusetts Institute of Technology. Engineering Systems Division |
| record_format | dspace |
| spelling | mit-1721.1/1030052019-04-09T18:19:35Z Train Timetable Design for Shared Railway Systems using a Linear Programming Approach to Approximate Dynamic Programming Pena-Alcaraz, Maite Webster, Mort Ramos, Andres In the last 15 years, the use of rail infrastructure by different train operating companies (shared railway system) has been proposed as a way to improve infrastructure utilization and to increase efficiency in the railway industry. Shared use requires coordination between the infrastructure manager and multiple train operators in a competitive framework, so that regulators must design appropriate capacity pricing and allocation mechanisms. However, the resulting capacity utilization from a given mechanism in the railway industry cannot be known in the absence of operations. Therefore assessment of capacity requires the determination of the train timetable, which eliminates any potential conflicts in bids from the operators. Although there is a broad literature that proposes train timetabling methods for railway systems with single operators, there are few models for shared competitive railway systems. This paper proposes a train timetabling model for shared railway systems that explicitly considers network effects and the existence of multiple operators requesting to operate several types of trains traveling along different routes in the network. The model is formulated and solved both as a mixed integer linear programming (MILP) problem (using a commercial solver) and as a dynamic programming (DP) problem. We solve the DP formulation with a novel algorithm based on a linear programming (LP) approach to approximate dynamic programming (ADP) that can solve much larger problems than are computationally intractable with commercial MILP solvers. The model simulates the optimal decisions by an infrastructure manager for a shared railway system with respect to a given objective function and safety constraints. This model can be used to evaluate alternative capacity pricing and allocation mechanism. We demonstrate the method for one possible capacity pricing and allocation mechanism, and show how the competing demands and the decisions of the infrastructure manager under this mechanism impact the operations on a shared railway system for all stakeholders. 2016-06-06T20:42:10Z 2016-06-06T20:42:10Z 2014-05 Working Paper http://hdl.handle.net/1721.1/103005 en_US ESD Working Papers;ESD-WP-2014-13 application/pdf Massachusetts Institute of Technology. Engineering Systems Division |
| spellingShingle | Pena-Alcaraz, Maite Webster, Mort Ramos, Andres Train Timetable Design for Shared Railway Systems using a Linear Programming Approach to Approximate Dynamic Programming |
| title | Train Timetable Design for Shared Railway Systems using a Linear Programming Approach to Approximate Dynamic Programming |
| title_full | Train Timetable Design for Shared Railway Systems using a Linear Programming Approach to Approximate Dynamic Programming |
| title_fullStr | Train Timetable Design for Shared Railway Systems using a Linear Programming Approach to Approximate Dynamic Programming |
| title_full_unstemmed | Train Timetable Design for Shared Railway Systems using a Linear Programming Approach to Approximate Dynamic Programming |
| title_short | Train Timetable Design for Shared Railway Systems using a Linear Programming Approach to Approximate Dynamic Programming |
| title_sort | train timetable design for shared railway systems using a linear programming approach to approximate dynamic programming |
| url | http://hdl.handle.net/1721.1/103005 |
| work_keys_str_mv | AT penaalcarazmaite traintimetabledesignforsharedrailwaysystemsusingalinearprogrammingapproachtoapproximatedynamicprogramming AT webstermort traintimetabledesignforsharedrailwaysystemsusingalinearprogrammingapproachtoapproximatedynamicprogramming AT ramosandres traintimetabledesignforsharedrailwaysystemsusingalinearprogrammingapproachtoapproximatedynamicprogramming |