Postoptimizing equilibrium flows on large scale networks

  • Nguyen S
  • Pallottino S
  • Inaudi D
  • 2

    Readers

    Mendeley users who have this article in their library.
  • 3

    Citations

    Citations of this article.

Abstract

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.

Author-supplied keywords

  • Equilibrium traffic model
  • Mathematical programming
  • Postoptimization

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • S. Nguyen

  • S. Pallottino

  • D. Inaudi

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free