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

Abstract

We consider an example to show that the minimum instantaneous cost path principle, as suggested in Friesz et al. [1] 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.