Journal
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
Volume 129, Issue -, Pages 79-95Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2019.09.006
Keywords
Urban rail transit; Last train scheduling; Passenger assignment; Destination reachability; Mixed integer linear programming
Categories
Funding
- Hong Kong's Research Grants Council [HKUST16211218]
- National Natural Science Foundation of China [71890974/71890970]
Ask authors/readers for more resources
As urban rail transit (URT) systems usually do not operate for the whole day, the last train service offers the last daily chance for late-night passengers to utilize URT services to reach their target destination stations. This paper formally introduces and models the destination-reachability based last train timetabling problem (DR-LTTP in abbreviation) in URT networks, which involves both the last train timetabling and the passenger assignment. The DR-LTTP is formulated as a mixed integer linear programming and can be solved by existing commercial optimization software. The model is illustrated with a simple numerical example on a minimum spanning tree network, and comparison experiments are conducted between DR-LTTP model and station-transferability based last train timetabling problem (ST-LTTP in abbreviation). Finally, a real case study with Beijing URT network is conducted to test the performance of our model. (C) 2019 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available