On the effect of Cost Changes in Shortest-Path Problems.

Author(s)
Baselau, S.
Year
Abstract

Shortest-path algorithms are a wide studied field and are used in vehiclenavigation systems. Road networks are dynamic because of varying flow rates. With traffic flow strategies it will be possible to influence computedroutes individually in order to achieve a better utilization of the road network. These strategies will be coded with AGORA-C in order to cover urban, interurban networks down to low classified roads. How link cost changes can influence the route calculation are shown using a short example. An experimental evaluation shows the usefulness and effect of link cost changes within a representation of the road network. For the covering abstract see ITRD E134653

Request publication

2 + 12 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
C 41062 (In: C 40997 CD-ROM) /72 / ITRD E134726
Source

In: Proceedings of the 13th World Congress and Exhibition on Intelligent Transport Systems (ITS) and Services, London, United Kingdom, 8-12 October 2006, 8 p.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.