Scholarlink

Abstract <p>The paper describes an algorithm for finding the Wardrop equilibrium and optimal distributions of traffic flows in an urban road network. A software code has been developed to implement this algorithm. A procedure is described for conducting numerical experiments and analyzing their results to study the computational complexity of the algorithm depending on the model dimension.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Study of Computational Complexity of an Algorithm for Finding the Traffic Flow Wardrop Equilibrium

  • 期刊论文

  • 发表日期：

    2025年12月1日

查看全文
  • Yu. V. Chirkova

摘要

Abstract

The paper describes an algorithm for finding the Wardrop equilibrium and optimal distributions of traffic flows in an urban road network. A software code has been developed to implement this algorithm. A procedure is described for conducting numerical experiments and analyzing their results to study the computational complexity of the algorithm depending on the model dimension.