Back to Search Start Over

A Path Planning Approach with Maximum Traffic Flow and Minimum Breakdown Probability in Complex Road Network

Authors :
Cao Mengqi
Li Demin
Zhang Guanglin
Xu Mengran
Liao Shuya
Source :
Computational Data and Social Networks ISBN: 9783030046477, CSoNet
Publication Year :
2018
Publisher :
Springer International Publishing, 2018.

Abstract

In urban scenarios, the issues of traffic congestion keep disturbing governments and individuals, especially in complex road networks. It seems urgent to improve road utilization for alleviating the traffic congestion. In this paper, we first propose an optimization model to improve the road utilization, which not only considers the traffic breakdown probability but also the spontaneous traffic flow. Traffic breakdown occurs during the transition from free flow to spontaneous flow and may probably cause traffic congestion. By considering traffic flow, more drivers can avoid traffic breakdown and the road utilization will be increasing. Secondly, in order to decrease the complexity and redundancy, this paper uses a big traffic flow condition and Taylor series to simplify the objective function and obtain an optimal result with accuracy. Finally, the simulations that use real urban traffic scenario of Songjiang University Town in ShangHai evaluate the proposed algorithm’s performance. Our proposed algorithm outperforms other existing path-planning algorithm.

Details

ISBN :
978-3-030-04647-7
ISBNs :
9783030046477
Database :
OpenAIRE
Journal :
Computational Data and Social Networks ISBN: 9783030046477, CSoNet
Accession number :
edsair.doi...........458fda2de14890597b8db7025876a5ed
Full Text :
https://doi.org/10.1007/978-3-030-04648-4_8