Dynamic flow control model and algorithm for metro network under FIFO condition
Year: 2024
Type: article
Abstract: Implementing passenger flow control strategies is an effective approach to reducing commuter travel delays and ensuring crowd safety in a congested metro network. The development of a scientific passenger flow control strategy is challenging in the networked mode of operation due to the intricacy of the interweaving of passenger flows between various lines and stations. The first-in-first-out (FIFO) rule can ensure fairness of service and optimal operation by accurate modeling of passenger queuing dynamics, but it is rarely considered in existing studies. Inspired by the traditional dynamic traffic assignment models, we propose a novel passenger flow control model with the FIFO rule to find a more reasonable control strategy for a metro network. As stranded passengers in the metro system will only queue outside the stations, which is quite different from road traffic systems, a group of linear constraints is proposed to explicitly capture the FIFO property at origin stations. The passenger flow control problem with the FIFO rule is then modeled as a mixed integer linear programming model, which can significantly reduce the model complexity. To reach a high-quality solution, we propose an efficient rolling horizon decomposition approach. In the algorithm, the planning horizon is rolled forward from the current time, and considers the effects of subsequent periods at each iteration. Besides, a dynamic procedure for loading passengers is developed to evaluate the bounds between the proposed approach and other flow control strategies. The proposed model and algorithm are then applied to solve the problem in test and real metro networks. The numerical results demonstrate the validity of the model's properties and the algorithm's performance.
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,700
OpenAlex ID: W4403930596
