Algorithms for Solving the Probit Path-Based Stochastic User Equilibrium Traffic Assignment Problem with One or More User Classes

Abstract

This paper considers different analytical approximation methods for the solution of the probit choice function and addresses their application for the calculation of the path-based stochastic user equilibrium (SUE) traffic pattern with one or more user classes. Methods are introduced that can be used for solving the probit choice function and an overview is provided of the analytical methods considered. The paper presents results of some numerical experiments carried out on artificial networks to test their accuracy and computational cost. A number of algorithms for solving the SUE traffic assignment problem with the approximation methods considered are presented and tested, and reports are provided on the use of similar algorithms to solve efficiently the SUE assignment when multiple user classes are considered.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 19 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.