This content is not included in
your SAE MOBILUS subscription, or you are not logged in.
A Semi-Cooperative Social Routing System to Reduce Traffic Congestion
Technical Paper
2019-01-0497
ISSN: 0148-7191, e-ISSN: 2688-3627
This content contains downloadable datasets
Annotation ability available
Sector:
Language:
English
Abstract
One of the ways to reduce city congestion is to balance the traffic flow on the road network and maximally utilize all road capacities. There are examples showing that, if the drivers are not competitive but cooperative, the road network usage efficiency and the traffic conditions can be improved. This motivates the idea of designing a cooperative routing algorithm to benefit most vehicles on the road. This paper presents a semi-cooperative social routing algorithm for large transportation network with predictive traffic density information. The goal is to integrate a cooperative scheme into the individual routing and achieve short traveling time not only for the traveler itself, but also for all vehicles in the road network. The most important concept of this algorithm is that the route is generated with the awareness of the total travel time added to all other vehicles on the road due to the increased congestion. Based on the macroscopic fundamental diagrams of different road segments in the road network, this impact can be quantified as the marginal social time cost. This cost can be considered as a measure of individual vehicle’s contribution to congestion, and used as part of the cost in the shortest-path algorithm. A trade-off is made between being extremely selfish and extremely cooperative.
Recommended Content
Topic
Citation
Zeng, X. and Mohanty, A., "A Semi-Cooperative Social Routing System to Reduce Traffic Congestion," SAE Technical Paper 2019-01-0497, 2019, https://doi.org/10.4271/2019-01-0497.Data Sets - Support Documents
| Title | Description | Download |
|---|---|---|
| Unnamed Dataset 1 |
Also In
References
- Roughgarden , T. and Tardos , É. How Bad is Selfish Routing? Journal of the ACM (JACM) 49 2 236 259 2002
- Çolak , S. , Lima , A. , and González , M.C. Understanding Congested Travel in Urban Areas Nature Communications 7 10793 2016
- Murchland , J.D. Braess's Paradox of Traffic Flow Transportation Research 4 4 391 394 1970
- Wikipedia, The Free Encyclopedia Braess's paradox https://en.wikipedia.org/wiki/Braess%27s_paradox 2018
- Adler , J.L. and Blue , V.J. A Cooperative Multi-Agent Transportation Management and Route Guidance System Transportation Research Part C: Emerging Technologies 10 5-6 433 454 2002
- Bast , H. , Delling , D. , Goldberg , A. , Müller-Hannemann , M. et al. Route Planning in Transportation Networks Algorithm Engineering Cham Springer 2016 19 80
- Sen , A.K. , Tiwari , G. , and Upadhyay , V. Estimating Marginal External Costs of Transport in Delhi Transport Policy 17 1 27 37 2010
- Simoni , M.D. , Pel , A.J. , Waraich , R.A. , and Hoogendoorn , S.P. Marginal Cost Congestion Pricing Based on the Network Fundamental Diagram Transportation Research Part C: Emerging Technologies 56 221 238 2015
- Ozbay , K. , Bartin , B. , Yanmaz-Tuzel , O. , and Berechman , J. Alternative Methods for Estimating Full Marginal Costs of Highway Transportation Transportation Research Part A: Policy and Practice 41 8 768 786 2007
- Yang , J. , Purevjav , A.-O. , and Li , S. The Marginal Cost of Traffic Congestion and Road Pricing: Evidence from a Natural Experiment in Beijing 2018
- Treiber , M. and Kesting , A. Traffic Flow Dynamics: Data, Models and Simulation Physics Today 67 3 54 2014