A Variable Formulation of Kinematic Waves: Solution Methods
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.
|Date of creation:||01 Nov 2003|
|Date of revision:|
|Contact details of provider:|| Postal: 109 McLaughlin Hall, Mail Code 1720, Berkeley, CA 94720-1720|
Web page: http://www.escholarship.org/repec/its/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Daganzo, Carlos F., 2003. "A Variational Formulation for a Class of First Order PDE's," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5p54n38q, Institute of Transportation Studies, UC Berkeley.
When requesting a correction, please mention this item's handle: RePEc:cdl:itsrrp:qt6683p9sj. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lisa Schiff)
If references are entirely missing, you can add them using this form.