Academic Journal
Προβολή σε EDS

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
FullText Text:
  Availability: 0
Header DbId: edb
DbLabel: Complementary Index
An: 193063974
RelevancyScore: 1041
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1040.81262207031
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Study of Computational Complexity of an Algorithm for Finding the Traffic Flow Wardrop Equilibrium.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Chirkova%2C+Yu%2E+V%2E%22">Chirkova, Yu. V.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Doklady Mathematics; 2025 Suppl 1, Vol. 112, pS67-S72, 6p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Traffic+flow%22">Traffic flow</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software+execution%22">Computer software execution</searchLink><br /><searchLink fieldCode="DE" term="%22Urban+transportation%22">Urban transportation</searchLink><br /><searchLink fieldCode="DE" term="%22Traffic+assignment%22">Traffic assignment</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+simulation%22">Computer simulation</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=193063974
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1134/S1064562425601064
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 6
        StartPage: S67
    Subjects:
      – SubjectFull: Computational complexity
        Type: general
      – SubjectFull: Traffic flow
        Type: general
      – SubjectFull: Computer software execution
        Type: general
      – SubjectFull: Urban transportation
        Type: general
      – SubjectFull: Traffic assignment
        Type: general
      – SubjectFull: Computer simulation
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: Study of Computational Complexity of an Algorithm for Finding the Traffic Flow Wardrop Equilibrium.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Chirkova, Yu. V.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 02
              M: 12
              Text: 2025 Suppl 1
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 10645624
          Numbering:
            – Type: volume
              Value: 112
          Titles:
            – TitleFull: Doklady Mathematics
              Type: main
ResultId 1