Transportation Planning and Management
Wei TAN, Xingkai GUI, Yuwen WANG, Xiaodong PENG, Maowei HE, Jun XIE
To address the lack of comparative studies on construction methods for large-scale multimodal transportation networks, this paper investigates the differences in computational efficiency and results among different methods. Firstly, the paper compares the impact of two network representation methods, i.e., route section and hyperpath, on the scale of extended networks across six different-sized bus networks. Secondly, it proposes a method for connecting transit stations with road network, and uses the node contraction method to create joint networks. Finally, in a large-scale multimodal transportation network, three types of shortest paths, i.e., simple path, route, and hyperpath, are computed for 100,000 OD pairs extracted from taxi trips, and their generalized time cost are compared with actual taxi trip costs. The research findings indicate that computation time follows the order of route > hyperpath > simple path, and the average shortest path cost follows the order of simple path > route > hyperpath. Compared with the actual taxi trips, the proportions of OD pairs with lower generalized time costs for simple path, route, and hyperpath are 39.21%, 41.29%, and 42.83%, respectively.