On a routing problem
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Given a set of N cities, with every two linked by a road, and the times required to traverse these roads, the functional equation technique of dynamic programming and approximation in policy space yield an iterative algorithm which converges after at most (N-1) iterations.
Abstract
Given a set of N N cities, with every two linked by a road, and the times required to traverse these roads, we wish to determine the path from one given city to another given city which minimizes the travel time. The times are not directly proportional to the distances due to varying quality of roads and varying quantities of traffic.