Repository KITopen (Karlsruhe Institute of Technology) · 2010 · 10 citations · 6 references
ComputingComputer ScienceTransportation PlanningAlgorithmsTransport PlanningTransportationHeuristic SearchRoute PlanningRoutingRouting AlgorithmsShortest Path AlgorithmsExplanation Of Mathematical DefinitionsRoute AlternativesRoute ChoiceRoute OptimizationRouting ProblemsShortest Path HeuristicsShortest Path On Road Networks
Every human likes choices. But today's fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative routes, but this topic has not been studied thoroughly. Often, the aspect of meaningful alternative routes is neglected from a human point of view. We fill in this gap by suggesting mathematical definitions for such routes. As a second contribution we propose heuristics to compute them, as this is NP-hard in general.
6
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
Finding the <i>K</i> Shortest Loopless Paths in a Network
Jin Y. Yen · Management Science · 1971 · 2.6K citations
David Eppstein · 2002 · 332 citations · Full text
FINDING ALTERNATIVES TO THE BEST PATH
Kinnon Scott, David Bernstein · 1997 · 34 citations