Selecting the most direct route in an urban road network

The paper presents a straightforward method of finding the most direct path between two sites in a road network when there are several paths of the same or approximately the same length. This situation tends to arise quite often in the dense road systems of urban neighborhoods. A minor modification of a shortest path algorithm to assess turn penalities will minimize the number of turns a vehicle makes and result in more direct, and hence practical, vehicle trips.