Academic Journal
Study of Computational Complexity of an Algorithm for Finding the Traffic Flow Wardrop Equilibrium.
| Τίτλος: | Study of Computational Complexity of an Algorithm for Finding the Traffic Flow Wardrop Equilibrium. |
|---|---|
| Συγγραφείς: | Chirkova, Yu. V. |
| Πηγή: | Doklady Mathematics; 2025 Suppl 1, Vol. 112, pS67-S72, 6p |
| Θεματικοί όροι: | Computational complexity, Traffic flow, Computer software execution, Urban transportation, Traffic assignment, Computer simulation, Algorithms |
| Περίληψη: | 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Doklady Mathematics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Complementary Index |
καταχωρήστε σχόλιο πρώτοι!