Optimal information location for adaptive routing

DOI10.1007/s11067-009-9108-9zbMath1213.90061OpenAlexW2151720151MaRDI QIDQ542094

Yong-Cai Geng, Sumit K. Garg

Publication date: 8 June 2011

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-009-9108-9

zbMATH Keywords

intelligent transportation systemsadaptive routinguser equilibriumadvanced traveler information systems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Related Items (5)

A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran ⋮ Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network ⋮ Multicriteria stochastic shortest path problem for electric vehicles ⋮ Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case ⋮ Ranking paths in stochastic time-dependent networks

Cites Work

• A directed hypergraph model for random time dependent shortest paths
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
• Stochastic shortest paths with recourse
• On the online shortest path problem with limited arc cost dependencies
• A polynomial-time algorithm to find shortest paths with recourse
• Stochastic shortest path problems with recourse
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs

This page was built for publication: Optimal information location for adaptive routing