Links have a flow capacity, that is, they do not release more vehicles per second than is possible according to their capacity. This leads to queue built-up if demand exceeds capacity. Links also have a storage capacity, which means that once a link is full, vehicles that want to enter the link need to wait. This leads to queue spill-back through the network. We derive the model's fundamental diagrams and explain it.
Route assignment is done by iterative feedback between micro-simulation and router.
An iterative solution of the route assignment for the above problem can be achieved within about half a day of computing time on a desktop workstation. We compare results with field data and with results of traditional assignment runs by the Portland Metropolitan Planning Organization. This should enable systematic research about the coupling of demand generation, route assignment, and micro-simulation output. Back to Contents of Vol.