×

Efficient traffic flow simulation computations. (English) Zbl 0800.90449


MSC:

90B20 Traffic problems in operations research

Software:

LINPACK
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Lighthill, M. H.; Witham, G. B., On kinematic waves: II A theory of traffic flow on long crowded roads, Proceed. R. Soc. Ser., A 229, 1178, 317-345 (1955) · Zbl 0064.20906
[2] Payne, H. J., Models of freeway traffic and control, Proceed. Math. of Publ. Syst., 1, 1, 51-61 (1971), Published by Simul. Council
[3] Michalopoulos, P. G.; Lin, J., A freeway simulation program for microcomputers, (In Proceed., 1st National Conf. on Microcomputers in Urban Transp. (1985), ASCE: ASCE California), 330-341
[4] Leo, C. J.; Pretty, R. L., Some Comments and Numerical Tests on Upwind Finite Difference Schemes for Macroscopic Traffic Modeling (1990), Dept. of Civil Eng., Univ. of Queensland: Dept. of Civil Eng., Univ. of Queensland Australia
[5] Hirsch, C., Numerical Computation of Internal and External Flows, Vol. 2 (1988), John Wiley and Sons
[6] Greenshields, B. D., A study of traffic capacity, In Proc. Highway Res. Board, Vol. 14, 448-477 (1934)
[7] McShane, W.; Roess, R., Traffic Engineering (1990), Prentice Hall
[8] Michalopoulos, P. G.; Yi, Ping; Beskos, D. E.; Lyrintzis, A. S., Continuum modeling of traffic dynamics, (In Proc. of the 2nd Int. Conf. on Appl. of Advanced Tech. in Transportation Eng. (1991), ASCE: ASCE Minneapolis, Minnesota), 36-40
[9] Michalopoulos, P. G.; Kwon, Eil; Kang, J., Enhancements and field testing of a dynamic freeway simulation program, Transportation Research Records (1991)
[10] Dongarra, J. J., LINPACK User’s Guide (1979), SIAM
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.