Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
DOI10.1287/TRSC.36.3.326.7827zbMATH Open1134.90467OpenAlexW2144844724WikidataQ59592569 ScholiaQ59592569MaRDI QIDQ4408702FDOQ4408702
Authors: Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà 
Publication date: 29 June 2003
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.36.3.326.7827
Recommendations
Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (16)
- Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
- Dynamic shortest paths minimizing travel times and costs
- Minimization of travel time and weighted number of stops in a traffic-light network
- Optimal bicycle routes with few signal stops
- Reachability for airline networks: fast algorithm for shortest path problem with time windows
- The searchlight problem for road networks
- A note on the minimum instantaneous cost path of the dynamic traffic assignment problem
- Minimum work paths in elevated networks
- Modular circulation and applications to traffic management
- Modular circulation and applications to traffic management
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
- Time-dependent routing problems: a review
- Shortest paths in time-dependent FIFO networks
- Phasing of traffic lights at a road junction
- Minimum Cost Paths in Periodic Graphs
- Finding \(K\) shortest looping paths in a traffic-light network
This page was built for publication: Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4408702)
