Institute of Transportation Studies at UC Berkeley

This paper presents improved solution methods for kinematic wave trafficc problems with concave flow-density relations. As explained in part I of this work, the solution of a kinematic wave problem is a set of continuum least-cost paths in space-time. The least cost to reach a point is the vehicle number. The idea here consists in overlaying a dense but discrete network with appropriate costs in the solution region and then using a shortest-path algorithm to estimate vehicle numbers. With properly designed networks, this procedure is more accurate than existing methods and can be applied to more complicated problems. In many important cases its results are exact.