Abstract
Computational efficiency and first in, first out (FIFO) are both important issues in applications such as dynamic traffic assignment. This paper first shows by example the FIFO properties of a computationally efficient commodity-based kinematic wave (CKW) model of network traffic flow. After the development of measurements of FIFO violation among commodities in location and time on the basis of the misplacement of vehicles in total and commodity traffic, it is argued theoretically that numerical CKW solutions converge to FIFO ones. Then, with numerical examples, it is shown that FIFO violation in CKW solutions is a function of the simulation time and the number of commodities but decreases with decreasing cell lengths, even for infinite number of commodities. Finally, the possible implications of this study are discussed.