On the convergence of the method of successive averages for calculating user equilibrium in traffic networks

Richard Mounce, Malachy Carey

Research output: Contribution to journalArticle

12 Citations (Scopus)
7 Downloads (Pure)

Abstract

The traffic assignment problem aims to calculate an equilibrium route flow vector, generally by seeking a zero of an appropriate objective function. If a continuous dynamical system follows a descent direction for this objective function at each nonequilibrium route flow vector, the system converges to equilibrium. It is shown that when this dynamical system is discretized with a fixed step length, the system eventually approaches close to equilibrium provided that the objective function is continuously differentiable and that the rate of descent is bounded below. The method of successive averages is widely used in traffic assignment; it has a decreasing step size at each iteration. With the same conditions as above, it is shown that the resulting dynamical system converges to equilibrium. In the steady-state model, the necessary conditions are shown to be satisfied, provided that the route cost vector is a continuously differentiable monotone function of the route flow vector. However, continuous differentiability of the cost function is shown not to hold in the dynamic queueing model.
Original languageEnglish
Pages (from-to)535-542
Number of pages8
JournalTransportation science
Volume49
Issue number3
Early online date23 May 2014
DOIs
Publication statusPublished - Aug 2015

Keywords

  • method of successive averages
  • equilibrium
  • traffic assignment
  • step length

Fingerprint Dive into the research topics of 'On the convergence of the method of successive averages for calculating user equilibrium in traffic networks'. Together they form a unique fingerprint.

  • Cite this