Pith. sign in

REVIEW 1 cited by

Multi-period line planning for varying railway passenger demand with asymmetric lines

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2509.02052 v1 pith:XPI3M6I2 submitted 2025-09-02 math.OC

Multi-period line planning for varying railway passenger demand with asymmetric lines

classification math.OC
keywords railwaylinedemandasymmetriclinesmodelplanvarying
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A line plan is an important aspect of the quality of the service provided to railway passengers. Although it is well-known that railway demand is varying throughout the day in volume and structure, the line plan is often still fixed throughout the day. To better match this varying railway demand, we propose a mixed-integer linear programming model for multi-period line planning. This model for railway networks incorporates selection of routes, stopping patterns, frequencies, transfers, and the possibility of asymmetric lines to deal with spatially unbalanced demand. The Epsilon-constraint method is used to determine Pareto optimal solutions. The proposed model and solution method are tested on a case study of part of the Dutch railway network. The results show that allowing for changes to the line plan during the day can reduce the total generalised journey time by up to 4.26%, especially when asymmetric lines are used.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Line Planning at Scale: Models, Methods, and Insights

    math.OC 2026-06 unverdicted novelty 5.0

    Empirical comparison on Dutch and Swiss railway instances shows a compact direct connection model outperforms the canonical change-and-go network on over 83% of 972 cases, with the latter failing on many large instances.