4.7 Article

The Price of Anarchy in Transportation Networks: Data-Driven Evaluation and Reduction Strategies

期刊

PROCEEDINGS OF THE IEEE
卷 106, 期 4, 页码 538-553

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JPROC.2018.2790405

关键词

Optimization; Price-of-Anarchy (PoA); sensitivity analysis; traffic assignment problem; transportation networks; variational inequalities

资金

  1. Direct For Computer & Info Scie & Enginr [1237022] Funding Source: National Science Foundation

向作者/读者索取更多资源

Among the many functions a smart city must support, transportation dominates in terms of resource consumption, strain on the environment, and frustration of its citizens. We study transportation networks under two different routing policies, the commonly assumed selfish user-centric routing policy and a socially optimal system-centric one. We consider a performance metric of efficiency-the Price of Anarchy (PoA)-defined as the ratio of the total travel latency cost under selfish routing over the corresponding quantity under socially optimal routing. We develop a data-driven approach to estimate the PoA, which we subsequently use to conduct a case study using extensive actual traffic data from the Eastern Massachusetts road network. To estimate the PoA, our approach learns from data a complete model of the transportation network, including origin destination demand and user preferences. We leverage this model to propose possible strategies to reduce the PoA and increase efficiency.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据