Abstract
We present a mixed-integer linear program (MILP) for line planning with modeand route choice. In contrast to existing approaches, the mode and route decisions of pas-sengers are modeled depending on the line plan and commercial solvers can be applied to solve the corresponding MILP. The model aims at finding line plans that maximize the profit for the railway operator while estimating the corresponding passenger demand with aggregate choice models. Hence, the resulting line plans are not only profitable for opera-tors but also attractive to passengers. By suitable preprocessing we are able to apply any aggregate choice model for mode choices using linear constraints. We provide and test means to improve the computational performance. Our experiments on the Intercity net-work of the Randstad, a metropolitan area in the Netherlands, show that models which assume a fixed passenger assignment to modes cannot attract the passenger numbers they were designed for and therefore lead to inferior profit compared with our new model.
| Original language | English |
|---|---|
| Pages (from-to) | 336-350 |
| Number of pages | 15 |
| Journal | Transportation Science |
| Volume | 57 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Mar 2023 |
Bibliographical note
Funding Information:The authors thank Robin Koot for help with the experiments; Joël van’t Wout from Netherlands Railways (NS) for the data and input; SURFsara (www.surfsara.nl) for the support in using the Lisa Compute Cluster; and two anonymous reviewers for helpful remarks that greatly contributed to improving this paper.
Publisher Copyright:
Copyright: © 2022 INFORMS.