Route Advice Based on Subnetwork Properties

Victor L. Knoop (), Hans van Lint and Serge P. Hoogendoorn
Additional contact information
Victor L. Knoop: Delft University of Technology, Department of Transport & Planning
Hans van Lint: Delft University of Technology, Department of Transport & Planning
Serge P. Hoogendoorn: Delft University of Technology, Department of Transport & Planning

A chapter in Traffic and Granular Flow '11, 2013, pp 379-388 from Springer

Abstract: Abstract Large scale routing strategies require many data, and high computational power if the basic information unit is small. This paper checks the effects of a routing strategy based on aggregated information, the average speed, of a subnetwork. In a grid-network this routing is compared with shortest-distance routing, and data-demanding shortest-time routing. Contrary to the fixed routing, the proposed average-speed routing algorithm can avoid congestion quite long time, and it still needs very few data. Furthermore, it is less sensitive to fluctuations than the control based on speeds on all links. This is a good starting point for further control based on the macroscopic fundamental diagram.

Keywords: Subnetwork; Macroscopic Fundamental Diagram (MFD); Routing Strategies; Shortest-distance Route; Outlinks (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-39669-4_36

Ordering information: This item can be ordered from
http://www.springer.com/9783642396694

DOI: 10.1007/978-3-642-39669-4_36

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().