Dynamic routing using maximal road capacity

Title

Dynamic routing using maximal road capacity

 Author

Rothkrantz, L.J.M.

Faculty

Electrical Engineering, Mathematics and Computer Science

 Department

Intelligent Interaction

 Date

2015-11-16

 Abstract

Current routing devices route an individual car driver from start to destination in the shortest time. In this paper we propose a routing algorithm, routing the whole population of car drivers in the shortest time. The algorithm is an adapted dynamic version of the shortest path algorithm of Dijkstra, taking care of current and future changing traffic loads on the highways. To use the maximal road capacity car drivers will be routed not only via the shortest individual route but also via routes with a small variation in traveling time. The algorithm has been tested in real life and simulation studies using a historic dataset of tracked cars.

 Subject

dynamic routing
shortest path algorithm
Ant Based Control

 To reference this document use:

http://resolver.tudelft.nl/uuid:61d1ed60-aa46-4e70-9c9b-3bb54b3bfe22

 Publisher

ACM

 ISBN

9781450333573

 Source

CompSysTech '15 International Conference on Computer Systems and Technologies Dublin (Ireland), June 25 - 26, 2015; Authors version

 Part of collection

Institutional Repository

 Document type

conference paper

 Rights

(c) 2015 Rothkrantz, L.J.M.
Files
PDF dynouting01-draft.pdf 1.18 MB
Close viewer