A Local Routing Strategy Based-On Estimated Waiting Time on BA Networks

Author(s):  
S. Sodsee ◽  
P. Meesad
2009 ◽  
pp. 733-738
Author(s):  
Mao-Bin Hu ◽  
Yong-Hong Wu ◽  
Rui Jiang ◽  
Qing-Song Wu ◽  
Wen-Xu Wang

2010 ◽  
Vol 19 (4) ◽  
pp. 040513 ◽  
Author(s):  
Liu Feng ◽  
Zhao Han ◽  
Li Ming ◽  
Ren Feng-Yuan ◽  
Zhu Yan-Bo

2010 ◽  
Vol 14 (9) ◽  
pp. 839-841 ◽  
Author(s):  
Sangsu Jung ◽  
Jihoon Sung ◽  
Yonghwan Bang ◽  
Malaz Kserawi ◽  
Hyeji Kim ◽  
...  

2011 ◽  
Vol 403-408 ◽  
pp. 2453-2456
Author(s):  
Xin Ling Shi ◽  
Li Jun Zhang ◽  
Da Kuo Wang

This paper proposes a new routing strategy on complex networks. Based on the idea of greedy algorithm, our routing strategy chooses the node that has the highest probability to reach destination with the studies of max degree search strategy. In the meantime, the dynamic information like queue length will affect influence our strategy in order to increase the capacity of network. The result of simulation shows our strategy has a better performance compare to other local routing strategy. This strategy can be used on different kinds of complex networks.


2019 ◽  
Vol 52 (9-10) ◽  
pp. 1461-1479
Author(s):  
Yu Yao ◽  
Xiaoning Zhu ◽  
Hua Shi ◽  
Pan Shang

As an important means of transportation, urban rail transit provides effective mobility, sufficient punctuality, strong security, and environment-friendliness in large cities. However, this transportation mode cannot offer a 24-h service to passengers with the consideration of operation cost and the necessity of maintenance, that is, a final time should be set. Therefore, operators need to design a last train timetable in consideration of the number of successful travel passengers and the total passenger transfer waiting time. This paper proposes a bi-level last train timetable optimization model. Its upper level model aims to maximize the number of passengers who travel by the last train service successful and minimize their transfer waiting time, and its lower level model aims to determine passenger route choice considering the detour routing strategy based on the last train timetable. A genetic algorithm is proposed to solve the upper level model, and the lower level model is solved by a semi-assignment algorithm. The implementation of the proposed model in the Beijing urban rail transit network proves that the model can optimize not only the number of successful transfer directions and successful travel passengers but also the passenger transfer waiting time of successful transfer directions. The optimization results can provide operators detailed information about the stations inaccessible to passengers from all origin stations and uncommon path guides for passengers of all origin–destination pairs. These types of information facilitate the operation of real-world urban rail transit systems.


Sign in / Sign up

Export Citation Format

Share Document