Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A K-th shortest path set algorithm for urban traffic network
KTH.
Show others and affiliations
2014 (English)In: Jiaotong Yunshu Xitong Gongcheng Yu Xinxi/Journal of Transportation Systems Engineering and Information Technology, ISSN 1009-6744, Vol. 14, no 3, 194-200 p.Article in journal (Refereed) Published
Abstract [en]

In urban traffic network, it is important to optimize traffic flow of the K-th shortest path that meets the travel demand and then allocate the OD traffic flow onto the paths. This paper investigates the algorithm of searching K-th shortest path that meets the travel demand. The method overcomes the weakness of the traditional algorithm that can only get single K-th shortest path. According to the second principle of Wardrop and the road impedance function theory, the paper analyzes the necessity of the path set searching method for optimizing traffic flow, and proposes the definition and criterions of the K-th shortest path set in urban traffic network. Then, it presents an algorithm with the polynomial time complexity for searching K-th shortest path set in urban traffic network. The simulation results show that all of the K-th shortest path which meet the travel demand can be obtained effectively, and the feasibility of traffic allocation on above path set is proved with comparison of traditional algorithms.

Place, publisher, year, edition, pages
2014. Vol. 14, no 3, 194-200 p.
National Category
Transport Systems and Logistics
Identifiers
URN: urn:nbn:se:kth:diva-161027Scopus ID: 2-s2.0-84904384223OAI: oai:DiVA.org:kth-161027DiVA: diva2:794771
Note

QC 20150312

Available from: 2015-03-12 Created: 2015-03-06 Last updated: 2015-03-12Bibliographically approved

Open Access in DiVA

No full text

Scopus

Search in DiVA

By author/editor
Wang, Weixing
By organisation
KTH
Transport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 59 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf