Candidate Sets for Alternative Routes in Road Networks
From MaRDI portal
Publication:2828197
DOI10.1145/2674395zbMath1348.90187OpenAlexW2163857115MaRDI QIDQ2828197
Dennis Schieferdecker, Dennis Luxen
Publication date: 24 October 2016
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2674395
Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem ⋮ Candidate Sets for Alternative Routes in Road Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On a multicriteria shortest path problem
- Heuristic search viewed as path finding in a graph
- Candidate Sets for Alternative Routes in Road Networks
- Hierarchical Hub Labelings for Shortest Paths
- Alternative Route Graphs in Road Networks
- VC-Dimension and Shortest Path Algorithms
- Engineering Multilevel Graph Partitioning Algorithms
- Fast Routing in Road Networks with Transit Nodes
- Engineering Route Planning Algorithms
- Finding the k Shortest Paths
- Efficient Route Compression for Hybrid Route Planning
- Alternative routes in road networks
- Minimum time-dependent travel times with contraction hierarchies
- Route Planning with Flexible Objective Functions
- Exact Combinatorial Branch-and-Bound for Graph Bisection
- Robust Mobile Route Planning with Limited Connectivity
- Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
- Engineering highway hierarchies
- Finding the K Shortest Loopless Paths in a Network
This page was built for publication: Candidate Sets for Alternative Routes in Road Networks
