Book Description

An attempt to determine an optimal route from one point to another, given a set of N cities, with every two linked by a road, and the times required to transverse these roads. The times are not directly proportional to the distances because of the varying quality of roads and quantities of traffic. The functional equation technique of dynamic programming, combined with approximation in policy space, yields an iterative algorithm which converges after a finite number if iterations bounded in advance.