EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1857. Multi-period line planning for varying railway demand considering stops, frequencies and asymmetric lines
Invited abstract in session WB-54: Demand-responsive public transport 1, stream Public Transport Optimization.
Wednesday, 10:30-12:00Room: S01 (building: 101)
Authors (first author is the speaker)
1. | Renate van der Knaap
|
Transport & Planning, Delft University of Technology | |
2. | Niels van Oort
|
TU Delft | |
3. | Menno de Bruyn
|
Netherlands Railways | |
4. | Rob Goverde
|
Transport and Planning, Delft University of Technology |
Abstract
The purpose of the line planning problem in railways is to determine a set of lines with their route, stops and frequency. This line plan is an important aspect of the quality of the service that a railway undertaking (RU) provides to its passengers. For example, it determines which origin-destination pairs are connected by a direct trip or need a transfer between lines. Although the railway demand is varying throughout the day in volumes and directions, the line plan is often constant throughout the day. To better match the supply with this varying demand, we present a mixed-integer linear programming model for multi-period line planning. With this model, we intent to determine a line plan for each period with different demand, that minimizes the generalised journey time (GJT) of the passengers. To meet the varying demand, we allow the model to make changes to the selected routes in the network, the stopping pattern, and the frequency in each period. Furthermore, we include the possibility of having asymmetric lines to deal with spatially unbalanced (peak hour) demand. Although changing the line plan during the day has a benefit for the passengers in terms of reduced GJT, it also comes with costs: RUs must create multiple plans and passengers need to adapt to multiple plans per day. Therefore, the ε-constraint method is used to create Pareto optimal solutions. We use Gurobi to solve the proposed model for a case study based on real data of part of the Dutch railway network.
Keywords
- Railway Applications
- Programming, Mixed-Integer
- Programming, Multi-Objective
Status: accepted
Back to the list of papers