6533b821fe1ef96bd127b06d
RESEARCH PRODUCT
Optimal Paths on Urban Networks Using Travelling Times Prevision
Carmine De NicolaRosanna ManzoAlfredo CutoloLuigi Raritàsubject
Mathematical optimizationTraffic congestion reconstruction with Kerner's three-phase theoryArticle SubjectComputer scienceFluid dynamic model; K shortest path algorithm; Travelling times previsionGeneral EngineeringTraffic simulationK shortest path algorithmMeasure (mathematics)lcsh:QA75.5-76.95Computer Science ApplicationsTraffic congestionFluid dynamic modelModeling and SimulationShortest path problemComputer Science::Networking and Internet Architecturelcsh:Electronic computers. Computer scienceTravelling times previsionDijkstra's algorithmConstrained Shortest Path FirstSimulationTraffic wavedescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2012-01-01 | Modelling and Simulation in Engineering |