Collaborative optimization for network-wide train composition planning and passenger flow control under passenger demand ambiguity

This paper investigates the network-wide collaborative optimization of train composition planning and passenger flow control (PFC) in metro systems. It is complicated by the spatio-temporal imbalance and ambiguity of passenger demand, whose exact probability distribution is often unobtainable. To address this challenge, we establish a two-stage distributionally robust optimization (DRO) model, where the first stage minimizes operational costs via train composition planning, and the second stage adjusts PFC tactically to reduce waiting numbers in response to realized passenger demand. To handle distributional ambiguity, we construct a fluctuation-based ambiguity set, requiring only the empirical distribution of the scenarios and fluctuation information. Through the application of strong duality principles, we further convert the original DRO model into a computationally tractable mixed-integer linear program. Computational results confirm that our proposed method not only produces high-quality solutions efficiently but also provides significantly robust PFC strategies compared to traditional benchmarking methods.

Authors

Institutions

Publication Details

Journal
International Journal of General Systems
Published
2026-10-14
DOI
https://doi.org/10.1080/03081079.2026.2748339
Primary Topic
Railway Systems and Energy Efficiency
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Collaborative optimization for network-wide train composition planning and passenger flow control under passenger demand ambiguity

Kai Yang, 杨建平, Zhengjie Wu, Yicun Chen et al.
International Journal of General Systems
Railway Systems and Energy Efficiency
article

Collaborative optimization for network-wide train composition planning and passenger flow control under passenger demand ambiguity

Kai Yang, 杨建平, Zhengjie Wu, Yicun Chen, Lixing Yang, Aoran Dong
article en

Abstract

This paper investigates the network-wide collaborative optimization of train composition planning and passenger flow control (PFC) in metro systems. It is complicated by the spatio-temporal imbalance and ambiguity of passenger demand, whose exact probability distribution is often unobtainable. To address this challenge, we establish a two-stage distributionally robust optimization (DRO) model, where the first stage minimizes operational costs via train composition planning, and the second stage adjusts PFC tactically to reduce waiting numbers in response to realized passenger demand. To handle distributional ambiguity, we construct a fluctuation-based ambiguity set, requiring only the empirical distribution of the scenarios and fluctuation information. Through the application of strong duality principles, we further convert the original DRO model into a computationally tractable mixed-integer linear program. Computational results confirm that our proposed method not only produces high-quality solutions efficiently but also provides significantly robust PFC strategies compared to traditional benchmarking methods.

International Journal of General Systems
Xuzhou University of Technology (CN), Beijing Jiaotong University (CN), PLA Academy of Military Science (CN)
National Natural Science Foundation of China, Ministry of Education of the People's Republic of China, Fundamental Research Funds for the Central Universities
Industry, innovation and infrastructure
Openalex Percentile: Top 12%
Railway Systems and Energy Efficiency
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.