Slika omota

A mixed-integer linear programming method for time-dependent line planning in passenger railway systems

Spremljeno u:
Izdano u:PLoS One vol. 20, no. 5 (May 2025), p. e0322394
Glavni autor: Shi, Xin
Daljnji autori: Zhou, Wenliang, Li, Xiang
Izdano:
Public Library of Science
Teme:
China
Trains
Time dependence
Passenger trains
Linear programming
Integer programming
Operating costs
Graph theory
Planning
Optimization
Railways
Railway networks
Algorithms
Mixed integer
Railroads
Nonlinear programming
Passengers
Case studies
Economic
Online pristup:Citation/Abstract
Full Text
Full Text - PDF
Oznake: Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
Sažetak:This paper addresses a line planning problem (LPP) that simultaneously optimizes both train and passenger times in passenger railway systems, considering time-dependent origin-destination-period demand and passenger train choice. The problem is clearly and flexibly modeled in a physical infrastructure-based directed graph, which efficiently integrates the train operation choice and the passenger train choice. The problem is first formulated as a mixed-integer, non-concave, and non-linear programming model aimed at minimizing both the total operating cost of trains and the total travel cost of passengers. To solve the problem, an extended time-dimension method is proposed to transform the non-concave and non-linear model into a mixed-integer linear programming (MILP) model that can be solved using a commercial solver. Additionally, a set of simplification strategies is introduced to reduce the computational complexity while ensuring the global optimality of the linear model. A case study of a busy Chinese railway line demonstrates that the optimized time-dependent line plan enhances operational efficiency and accommodates the diversified travel preferences driven by time-dependent demand.
ISSN:1932-6203
Digitalni identifikator objekta:10.1371/journal.pone.0322394
Izvor:Health & Medical Collection