Paper Info
Title
Routing multiple cars in large scale networks: Minimizing road network breakdown probability
Abstract
Traffic has become a universal metropolitan problem. This paper aims at easing the traffic jam situation through routing multiple cars cooperatively. We propose a novel distributed multi-vehicle routing algorithm with an objective of minimizing the road network breakdown probability. The algorithm is distributed, and hence highly scalable, making it applicable for large scale metropolitan road networks. Our algorithm always guarantees a much faster convergence rate than traditional distributed optimization techniques such as dual decomposition. Additionally, the algorithm always guarantees a feasible solution during the optimization process. This feature allows for real time decision making when applied to scenarios with time limits. We show the effectiveness of the algorithm by applying it to an arbitrarily large road network in simulation environment.
Year
DOI
Venue
2014
10.1109/ITSC.2014.6958026
ITSC
Keywords
Field
DocType
convergence,minimisation,probability,road traffic,vehicle routing,arbitrarily large road network,convergence rate,distributed multivehicle routing algorithm,distributed optimization techniques,dual decomposition,large scale metropolitan road networks,multiple car routing,road network breakdown probability minimization,traffic jam situation,universal metropolitan problem,cooperative routing,distributed optimization,large scale network,road network breakdown,networks,optimization,routing,traffic flow,algorithms
Multipath routing,Equal-cost multi-path routing,Link-state routing protocol,Dynamic Source Routing,Static routing,Simulation,Hierarchical routing,Destination-Sequenced Distance Vector routing,Routing domain,Engineering
Conference
Citations 
PageRank 
References 
2
0.39
7
Authors
5
Name
Order
Citations
PageRank
Hongliang Guo1687.48
zhiguang cao26811.12
Jie Zhang31995156.26
Niyato Dusit49486547.06
u fastenrath560.83