A note on the minimum instantaneous cost path of the dynamic traffic assignment problem

A note on the minimum instantaneous cost path of the dynamic traffic assignment problem

0.00 Avg rating0 Votes
Article ID: iaor1996948
Country: Switzerland
Volume: 60
Issue: 1
Start Page Number: 115
End Page Number: 120
Publication Date: Dec 1995
Journal: Annals of Operations Research
Authors:
Abstract:

The paper considers an example to show that the minimum instantaneous cost path principle, as suggested in Friesz et al 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 the present example six times.

Reviews

Required fields are marked *. Your email address will not be published.