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

Auteur(s)
Baselau, S.
Jaar
Samenvatting

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

Publicatie aanvragen

4 + 1 =
Los deze eenvoudige rekenoefening op en voer het resultaat in. Bijvoorbeeld: voor 1+3, voer 4 in.

Publicatie

Bibliotheeknummer
C 41062 (In: C 40997 CD-ROM) /72 / ITRD E134726
Uitgave

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.

Onze collectie

Deze publicatie behoort tot de overige publicaties die we naast de SWOV-publicaties in onze collectie hebben.