Abstract
Cars that get delay in bottle-necks cannot be present in downstream at the same time. In traditional assignment-models, the cars are assigned to the entire route and therefore present at the same time on all links on that route. This can give less good outcomes of the calculations in some cases. If the assignment is done in a space with time as third dimension the problem of the less good assignment can be overcome. The proposed algorithm is additive to existing traditional assignment models, although the algorithm differs from them principally in some details.