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 条

[11]

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 (II), Journal of Northern Jiaotong University, 24, 6, pp. 8-13, (2000)

[12]

Qian Z., Lu H., An assignment method for transit network and its practical application, Journal of Tsinghua University (Science and Technology), 45, 9, pp. 1170-1174, (2005)

[13]

Wu Y., Peng X., Huang T., Research on path set operation based algorithm for path searching in public transit network, Computer Science, 36, 6, pp. 239-272, (2009)

[14]

Su A., Shi F., Optimal route choice of public traffic network based on shortest path searching, Journal of Engineering Graphics, 4, pp. 55-59, (2005)

[15]

Yao C., Li X., Shen L., Weighted directed graph model for searching optimal travel routes by public transport, Application Research of Computers, 30, 4, pp. 1058-1063, (2013)

[16]

Xu Y., Li J., Zhang J., Et al., New urban transit network models and optimal path searching algorithm, Systems Engineering-Theory and Practice, 31, 11, pp. 2234-2240, (2011)

[17]

Wen J., Liu W., Public transit network modeling for shortest path algorithm, Transport Standardization, 8, 243, pp. 177-178, (2011)

[18]

Zhou Y., Deng W., Hu Q., Study on the optimization of public transit network based on genetic algorithm and tabu search algorithm, Journal o f Wuhan University of Technology (Transportation Science & Engineering), 35, 1, pp. 42-45, (2011)

[19]

Xu L., Lin Q., Transit trip optimal route choice algorithm based on GBAS, Journal of Highway and Transportation Research and Development, 27, 3, pp. 154-158, (2010)

[20]

Zhou W., Li Z., Liu H., Et al., Mathematical models and algorithms of optimal public transportation line choice problem, Operations Research and Management Science, 17, 5, pp. 80-84, (2008)

← 1 2 3 →