Detecting Braess paradox in the stable dynamic model

Dorn Y.V., Shitikov O.M.
 pdf (1728K)

The work investigates the search for inefficient edges in the model of stable dynamics by Nestrov – de Palma (2003). For this purpose, we prove several general theorems about equilibrium properties, including the condition of equal costs for all used routes that can be extended to all paths involving edges from equilibrium routes. The study demonstrates that the standard problem formulation of finding edges whose removal reduces the cost of travel for all participants has no practical significance because the same edge can be both efficient and inefficient depending on the network’s load. In the work, we introduce the concept of an inefficient edge based on the sensitivity of total driver costs to the costs on the edge. The paper provides an algorithm for finding inefficient edges and presents the results of numerical experiments for the transportation network of the city of Anaheim.

Keywords: transportation modeling, Braess paradox
Citation in English: Dorn Y.V., Shitikov O.M. Detecting Braess paradox in the stable dynamic model // Computer Research and Modeling, 2024, vol. 16, no. 1, pp. 35-51
Citation in English: Dorn Y.V., Shitikov O.M. Detecting Braess paradox in the stable dynamic model // Computer Research and Modeling, 2024, vol. 16, no. 1, pp. 35-51
DOI: 10.20537/2076-7633-2024-16-1-35-51
URL: http://crm-en.ics.org.ru/journal/article/3432/
Creative Commons License This work is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License.

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"

Copyright © 2009–2024 Institute of Computer Science