zbMATH — the first resource for mathematics

A note on the minimum instantaneous cost path of the dynamic traffic assignment problem. (English) Zbl 0842.90033
Summary: We consider an example to show that the minimum instantaneous cost path principle, as suggested by T. L. Friesz, J. Lucque, R. L. Tobin, B.-W. Wie [Oper. Res. 37, No. 6, 893-901 (1989; Zbl 0691.49029)] for generalising Wardrop’s first principle to the dynamic state, may cause some drivers’ routes to “loop”. These looping routes traverse the same link more than once – indeed, in our example six times.
Reviewer: Reviewer (Berlin)

90B06 Transportation, logistics and supply chain management
Full Text: DOI
[1] T. L. Friesz, J. Luque, R. L. Tobin and B.-W. Wie, Dynamic network traffic assignment considered as a continuous time optimal control problem, Operations Research 37(1989)893–901. · Zbl 0691.49029 · doi:10.1287/opre.37.6.893
[2] J.G. Wardrop, Some theoretical aspects of road traffic research, Proc. Instit. Civ. Eng., Part II, 1 (1952) 325–362.
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.