Status: IN
Routing heuristics prioritize guaranteed optimality over search efficiency: A* uses haversine distance (always underestimates road distance) and time optimization divides by the global maximum speed limit (always underestimates travel time) — both are admissible heuristics that guarantee optimal paths at the cost of exploring unnecessary nodes.
Both heuristic choices sacrifice tightness for admissibility, choosing provable correctness (guaranteed optimal path) over practical performance (fewer nodes explored)
Depends on (SL): maps-astar-heuristic-admissible, maps-time-heuristic-uses-global-max-speed