描述交通网络中的Braess悖论

ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585) Pub Date : 2001-08-25 DOI:10.1109/ITSC.2001.948769

J. N. Hagstrom, R. Abrams

{"title":"描述交通网络中的Braess悖论","authors":"J. N. Hagstrom, R. Abrams","doi":"10.1109/ITSC.2001.948769","DOIUrl":null,"url":null,"abstract":"We generalize Braess's (1968) paradoxical example by defining a Braess paradox to occur when the Wardrop equilibrium distribution of traffic flows is not strongly Pareto optimal. We characterize a Braess paradox in terms of the solution to a mathematical program. Examples illustrate unexpected properties of these solutions. We discuss a computational approach to detecting a Braess paradox.","PeriodicalId":173372,"journal":{"name":"ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"63","resultStr":"{\"title\":\"Characterizing Braess's paradox for traffic networks\",\"authors\":\"J. N. Hagstrom, R. Abrams\",\"doi\":\"10.1109/ITSC.2001.948769\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We generalize Braess's (1968) paradoxical example by defining a Braess paradox to occur when the Wardrop equilibrium distribution of traffic flows is not strongly Pareto optimal. We characterize a Braess paradox in terms of the solution to a mathematical program. Examples illustrate unexpected properties of these solutions. We discuss a computational approach to detecting a Braess paradox.\",\"PeriodicalId\":173372,\"journal\":{\"name\":\"ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"63\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITSC.2001.948769\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2001.948769","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 63

摘要

我们通过定义交通流的Wardrop均衡分布不是强帕累托最优时发生的Braess悖论来推广Braess(1968)悖论的例子。我们用一个数学程序的解来描述Braess悖论。示例说明了这些解决方案的意想不到的特性。我们讨论了一种检测Braess悖论的计算方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Characterizing Braess's paradox for traffic networks

We generalize Braess's (1968) paradoxical example by defining a Braess paradox to occur when the Wardrop equilibrium distribution of traffic flows is not strongly Pareto optimal. We characterize a Braess paradox in terms of the solution to a mathematical program. Examples illustrate unexpected properties of these solutions. We discuss a computational approach to detecting a Braess paradox.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)

自引率

0.00%

发文量