Decremental algorithm for adaptive routing incorporating traveler information
From MaRDI portal
Publication:339637
DOI10.1016/j.cor.2012.03.006zbMath1349.90068OpenAlexW2008845633MaRDI QIDQ339637
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.006
shortest path problemonline optimizationcontinuous-time dynamic networkreal-time travel timevehicle navigation system
Related Items (5)
A forward-looking anticipative viscous high-order continuum model considering two leading vehicles for traffic flow through wireless V2X communication in autonomous and connected vehicle environment ⋮ A new higher-order viscous continuum traffic flow model considering driver memory in the era of autonomous and connected vehicles ⋮ A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths ⋮ A percentile system optimization approach with and without path enumeration ⋮ Ranking paths in stochastic time-dependent networks
Cites Work
- Point-to-point shortest paths on dynamic time-dependent road networks
- Vehicle routing with stochastic time-dependent travel times
- Bounded incremental computation
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Engineering Route Planning Algorithms
- A new approach to dynamic all pairs shortest paths
This page was built for publication: Decremental algorithm for adaptive routing incorporating traveler information
