Publication Type

Journal Article

Version

publishedVersion

Publication Date

1-2004

Abstract

The multiclass network equilibrium problem is expressed in general as a nonmonotone, asymmetric, variational inequality problem. We show that in spite of the nonmonotonicity of the cost operator, the problem may actually satisfy a weaker property, induced by the hierarchical nature of the travel cost interactions. This property allows a natural decomposition approach, not otherwise available, that admits provably convergent algorithms. We present one such algorithm, easily implementable using a solver for the single-class network equilibrium problem, together with a convergence proof.

Keywords

multiclass traffic network equilibrium, nested monotonicity, variational inequalities

Discipline

Digital Communications and Networking | Transportation

Research Areas

Intelligent Systems and Optimization

Areas of Excellence

Digital transformation

Publication

Transportation Science

Volume

38

Issue

3

First Page

282

Last Page

292

ISSN

0041-1655

Identifier

10.1287/trsc.1030.0039

Publisher

Institute for Operations Research and Management Sciences

Additional URL

https://doi.org/10.1287/trsc.1030.0039

Share

COinS