Postoptimizing equilibrium flows on large scale networks

Citations of this article
Mendeley users who have this article in their library.
Get full text


In a large variety of applications, equilibrium traffic flows corresponding to a set of slightly modified input data must be computed sequentially. Until now, it is believed that only a disaggregate decomposition 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 does not require path information. Numerical experiments on practical size networks show a drastic reduction in the number of iterations with respect to the naive restart approach.




Nguyen, S., Pallottino, S., & Inaudi, D. (1996). Postoptimizing equilibrium flows on large scale networks. European Journal of Operational Research, 91(3), 507–516.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free