open access publication

Article, 2024

A variational inequality formulation for stochastic user equilibrium with a bounded choice set

Computers & Operations Research, ISSN 1873-765X, 0305-0548, Volume 167, Page 106677, 10.1016/j.cor.2024.106677

Contributors

Jiang, Yao 0000-0001-9461-633X [1] [2]

Affiliations

  1. [1] Lancaster University
  2. [NORA names: United Kingdom; Europe, Non-EU; OECD];
  3. [2] Technical University of Denmark
  4. [NORA names: DTU Technical University of Denmark; University; Denmark; Europe, EU; Nordic; OECD]

Abstract

This study develops a variational inequality (VI) formulation for the stochastic user equilibrium with a bounded choice set, known as the bounded choice model (BCM). A novel mapping is devised to facilitate the development of the VI formulation. The VI formulation offers a new avenue for analysing and solving the BCM. It is shown that all paths in the considered choice set should have an equal mapping at the optimal solution, which resembles the equilibrated travel cost in the user equilibrium (UE). The new formulation has two algorithmic benefits. First, an algorithm that solves a VI problem (i.e., the extragradient method) can outperform the method of successive averages (MSA) in large networks under a UE-type convergent measurement. Second, it is possible to avoid the column reduction procedure when finding the choice set that satisfies the BCM requirement because a projection-type algorithm that solves the VI formulation can assign zero flow to a path. This is more efficient than the MSA, which uses diminishing step sizes to update solutions over iterations, leading to a sublinear rate of convergence and small residual flows on paths that should carry zero flows. Numerical experiments are conducted to demonstrate the properties of the model and compare the performance of different algorithms using the Sioux Falls, Eastern Massachusetts, and Anaheim networks.

Keywords

Anaheim, Anaheim network, BCM, Eastern, MSA, Massachusetts, Sioux, Sioux Falls, VI formulation, VI problem, algorithm, algorithm benefits, average, benefits, column, convergence, convergent measures, cost, development, eastern Massachusetts, equilibrium, experiments, fall, flow, formulation, inequality, inequality formulation, iteration, maps, measurements, method, model, network, novel mapping, numerical experiments, optimal solution, path, performance, problem, procedure, projection-type algorithm, properties, rate, rate of convergence, reduction procedure, requirements, residual flow, solution, stochastic user equilibrium, study, travel cost, update solutions, user equilibrium, users, variational inequalities, variational inequality formulation

Funders

  • Danish Agency for Science and Higher Education

Data Provider: Digital Science