Optimal Allocation Of Trips To A Street Network

Abstract

A discrete version of the maximum principle is applied to a multi-copy traffic assignment problem. This technique allows the use of nonlinear travel time-traffic volume relationships which are considered to be more realistic than the constant travel time relationship now generally used. The technique is demonstrated through the use of a prototype urban street and freeway network. The technique produces realistic results that achieve near minimal overall travel time on the network.