Assignment-based Path Choice Estimation for Metro Systems Using Smart Card Data
January 09, 2020 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Baichuan Mo, Zhenliang Ma, Haris N. Koutsopoulos, Jinhua Zhao
arXiv ID
2001.03196
Category
cs.DS: Data Structures & Algorithms
Cross-listed
stat.AP
Citations
5
Venue
arXiv.org
Last Checked
4 months ago
Abstract
Urban rail services are the principal means of public transportation in many cities. To understand the crowding patterns and develop efficient operation strategies in the system, obtaining path choices is important. This paper proposed an assignment-based path choice estimation framework using automated fare collection (AFC) data. The framework captures the inherent correlation of crowding among stations, as well as the interaction between path choice and left behind. The path choice estimation is formulated as an optimization problem. The original problem is intractable because of a non-analytical constraint and a non-linear equation constraint. A solution procedure is proposed to decompose the original problem into three tractable sub-problems, which can be solved efficiently. The model is validated using both synthetic data and real-world AFC data in Hong Kong Mass Transit Railway (MTR) system. The synthetic data test validates the model's effectiveness in estimating path choice parameters, which can outperform the purely simulation-based optimization methods in both accuracy and efficiency. The test results using actual data show that the estimated path shares are more reasonable than survey-derived path shares and uniform path shares. Model robustness in terms of different initial values and different case study dates are also verified.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted