A Non-Deterministic Path Generation Algorithm for Traffic Networks

In many transportation applications it is useful to find multiple paths for an origin-destination pair. This paper presents a non-deterministic approach to generate alternative paths in traffic networks. The algorithm exhibits desirable features in both computational complexity and path quality. Hypothetic examples are provided to evaluate the generated paths in terms of diversity and efficiency. A microscopic traffic simulation is then used to introduce potential applications in transportation practices. Some future works are also discussed.


Issue Date:
2006-03
Publication Type:
Conference Paper/ Presentation
PURL Identifier:
http://purl.umn.edu/208047
Total Pages:
19




 Record created 2017-04-01, last modified 2017-08-28

Fulltext:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)