Optimal Paths on Urban Networks Using Travelling Times Prevision
We deal with an algorithm that, once origin and destination are fixed, individuates the route that permits to reach the destination in the shortest time, respecting an assigned maximal travel time, and with risks measure below a given threshold. A fluid dynamic model for road networks, according to...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Modelling and Simulation in Engineering |
Online Access: | http://dx.doi.org/10.1155/2012/564168 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832564064554844160 |
---|---|
author | Alfredo Cutolo Carmine De Nicola Rosanna Manzo Luigi Rarità |
author_facet | Alfredo Cutolo Carmine De Nicola Rosanna Manzo Luigi Rarità |
author_sort | Alfredo Cutolo |
collection | DOAJ |
description | We deal with an algorithm that, once origin and destination are fixed,
individuates the route that permits to reach the destination in the shortest time,
respecting an assigned maximal travel time, and with risks measure below a given
threshold. A fluid dynamic model for road networks, according to initial car densities
on roads and traffic coefficients at junctions, forecasts the future traffic evolution,
giving dynamical weights to a constrained 𝐾 shortest path algorithm. Simulations
are performed on a case study to test the efficiency of the proposed procedure. |
format | Article |
id | doaj-art-8c6782429ddf4a70b5b1603e87cf49e2 |
institution | Kabale University |
issn | 1687-5591 1687-5605 |
language | English |
publishDate | 2012-01-01 |
publisher | Wiley |
record_format | Article |
series | Modelling and Simulation in Engineering |
spelling | doaj-art-8c6782429ddf4a70b5b1603e87cf49e22025-02-03T01:11:54ZengWileyModelling and Simulation in Engineering1687-55911687-56052012-01-01201210.1155/2012/564168564168Optimal Paths on Urban Networks Using Travelling Times PrevisionAlfredo Cutolo0Carmine De Nicola1Rosanna Manzo2Luigi Rarità3Università degli Studi di Salerno, Via Ponte Don Melillo, 84084 Fisciano, ItalyUniversità degli Studi di Salerno, Via Ponte Don Melillo, 84084 Fisciano, ItalyUniversità degli Studi di Salerno, Via Ponte Don Melillo, 84084 Fisciano, ItalyUniversità degli Studi di Salerno, Via Ponte Don Melillo, 84084 Fisciano, ItalyWe deal with an algorithm that, once origin and destination are fixed, individuates the route that permits to reach the destination in the shortest time, respecting an assigned maximal travel time, and with risks measure below a given threshold. A fluid dynamic model for road networks, according to initial car densities on roads and traffic coefficients at junctions, forecasts the future traffic evolution, giving dynamical weights to a constrained 𝐾 shortest path algorithm. Simulations are performed on a case study to test the efficiency of the proposed procedure.http://dx.doi.org/10.1155/2012/564168 |
spellingShingle | Alfredo Cutolo Carmine De Nicola Rosanna Manzo Luigi Rarità Optimal Paths on Urban Networks Using Travelling Times Prevision Modelling and Simulation in Engineering |
title | Optimal Paths on Urban Networks Using Travelling Times Prevision |
title_full | Optimal Paths on Urban Networks Using Travelling Times Prevision |
title_fullStr | Optimal Paths on Urban Networks Using Travelling Times Prevision |
title_full_unstemmed | Optimal Paths on Urban Networks Using Travelling Times Prevision |
title_short | Optimal Paths on Urban Networks Using Travelling Times Prevision |
title_sort | optimal paths on urban networks using travelling times prevision |
url | http://dx.doi.org/10.1155/2012/564168 |
work_keys_str_mv | AT alfredocutolo optimalpathsonurbannetworksusingtravellingtimesprevision AT carminedenicola optimalpathsonurbannetworksusingtravellingtimesprevision AT rosannamanzo optimalpathsonurbannetworksusingtravellingtimesprevision AT luigirarita optimalpathsonurbannetworksusingtravellingtimesprevision |