Mathematical programming model and algorithm for time-varying transit network

被引：0

作者：

Xu, Yong ^{[1
]}

Li, Jie ^{[2
]}

An, Liping ^{[3
]}

Wang, Ping ^{[4
]}

Chu, Chao-Hsien ^{[5
]}

机构：

[1] School of Science, Hebei University of Technology, Tianjin

[2] School of Software and Microelectronics at Wuxi, Peking University, Wuxi

[3] School of Business Nankai University, Tianjin

[4] School of Software and Microelectronics, Peking University, Beijing

[5] School of Information Systems, Singapore Management University, Singapore

来源：

Complex Systems and Complexity Science | 2015年 / 12卷 / 03期

关键词：

Mapping network; Public transport network; Transfer lines; Transfer time;

D O I：

10.13306/j.1672-3813.2015.03.001

中图分类号：

学科分类号：

摘要：

The shortest path query problem in large scale time-varying transit network is NP-hard. Approximate search algorithm is not satisfactory, and the exact search algorithm is inefficient. In this paper, a time-varying mathematical model for transit network is formulated according to the time-varying and uncertainty characteristic of public transport network. The choice of the optimal path for transit network is decomposed into transfer times and transfer line query problem. A query algorithm for transfer times is proposed based on the line mapping network and an algorithm for both transfer site and travel distance is proposed based on site mapping network. Both of them are polynomial. Finally we use a numerical example to illustrate the solution process of the proposed method. ©, 2015, The Journal Agency of Complex System and Complexity Science. All right reserved.

引用

页码：1 / 6

页数：5

共 24 条

[1]

Ernesto C., Stefano G., Marco P., Transit network design: a procedure and an application to a large urban area, Transportation Research Part C, 20, 1, pp. 3-14, (2012)

[2]

Antonio M., Maria E.U., A route set construction algorithm for the transit network design problem, Computers & Operations Research, 36, 8, pp. 2440-2449, (2009)

[3]

Ceder A., Wilson N., Bus network design, Transportation Research Part B, 20, 4, pp. 331-344, (1986)

[4]

Baaj M.H., Mahmassani H., An AI-based approach for transit route system planning and design, Journal of Advanced Transportation, 25, 2, pp. 187-210, (1991)

[5]

Tong C.O., Wong S.C., A stochastic transit assignment model using a dynamic schedule-based network, Transportation Research Part B, 33, 2, pp. 107-121, (1998)

[6]

Zhao F., Ubaka I., Optimization of transit network to minimize transfers and optimize route directness, Journal of Public Transportation, 7, 1, pp. 63-82, (2004)

[7]

Di Z., An assignment model for transit network based on the least transfer, Journal of Systems Science, 9, 3, pp. 78-81, (2011)

[8]

Si B., Gao Z., A study on the equilibrium assignment model and algorithm for urban transit network, Journal of Highway and Transportation Research and Development, 9, 3, pp. 41-44, (1998)

[9]

Song Y., Gao Z., Transit equilibrium assignment for congested public transport systems, China Journal of Highway and Transport, 12, 4, pp. 88-95, (1999)

[10]

Gao Z., Song Y., Si B., Et al., A SUE Assignment model and solution algorithm with elastic transit demand and bottlenecks for public transport networks (I), Journal of Northern Jiaotong University, 24, 6, pp. 1-7, (2000)

← 1 2 3 →