POSTOPTIMIZING EQUILIBRIUM FLOWS ON LARGE-SCALE NETWORKS

In a large variety of applications, equilibrium traffic flows correspo nding to a set of slightly modified input data must be computed sequen tially. Until now, it is believed that only a disaggregate decompositi on approach, that works explicitly on the path flow space, offers the postoptimization capability. This note proposes a new postoptimization method to deal with perturbations of the traffic demand input that do es not require path information. Numerical experiments on practical si ze networks show a drastic reduction in the number of iterations with respect to the naive restart approach.