Cited by 25Transportation Planning and OptimizationTraffic control and managementVehicle Routing Optimization Methods

New formulations of the stochastic user equilibrium with logit route choice as an extension of the deterministic model

Gentile, Guido·2018·Transportation Science

Abstract

This paper addresses the stochastic user equilibrium (SUE) in the case where the route choice is the multinomial logit model (MNL). Our main finding is that MNL SUE can be formulated and solved as an immediate extension of the deterministic user equilibrium (DUE) through a particular application of Wardrop’s first principle. The latter states, in general, that at equilibrium, the cost of all used routes is equal and not higher than those of unused routes. The extension is achieved by applying this statement to the “perceived cost” of a choice alternative, which is defined here as its generalized cost plus the logarithm of its choice probability multiplied by the logit parameter. Thus, substituting in DUE models the generalized costs with the perceived costs allows to easily adapt to MNL SUE the existing formulations and algorithms for DUE, as well as to manage a smooth transition of the route choice model from stochastic to deterministic by reducing the logit parameter down to zero. Particular consideration is devoted to the interpretation of the numerical solution as a restricted logit model, where only sufficiently good alternatives receive a positive probability. A family of MNL SUE models is then presented ranging from nonlinear optimization to variational inequalities and fixed-point problems, with both explicit and implicit path enumeration. A range of numerical tests is presented with the aim of assessing the continuity of the model results for decreasing logit parameter and proving the applicability of the proposed approach to real size networks, with particular emphasis on the performance and convergence of the methods.

Integrity signals

Registry

Crossref · 10.1287/trsc.2018.0839

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Traditional efforts to solve congestion problems have been centred on moving demand to transit and better managing road traffic using traffic simulation, dynamic network loading equilibria, and dynamic models.

    “Traditional efforts to solve congestion problems have been centred in attempts to move the demand on the transit system [96] and on a better management of road traffic using tools such as traffic simulation [97][98][99][100][101][102], dynamic network loading equilibria, and dynamic models [103,104] for the simulation and management of user route choice [105-109].”

    From A Review of Blockchain-Based Systems in Transportation (2019) · cites this paper as [103]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Gentile, G.
Affiliations
Sapienza University of Rome (IT)
Corresponding author
Gentile, Guido
Venue
Transportation Science
Published
2018-12
Volume
52
Issue
6
Pages
1531-1547
ISSN
  • 0041-1655 (ISSN-L)
  • 1526-5447
OpenAlex
W2893316433
Cited by
25
References
35
Citations by year
2026: 1 · 2025: 2 · 2024: 3 · 2023: 1 · 2022: 1 · 2021: 7 · 2020: 9 · 2019: 1
FWCI
5.24
Type
journal article
Language
en
Open access
closed
Locations
  • Transportation Science (publishedVersion)
  • IRIS Research product catalog (Sapienza University of Rome) (submittedVersion)
Topics
  • Social Sciences › Transportation › Transportation Planning and Optimization
  • Physical Sciences › Engineering › Control and Systems Engineering › Traffic control and management
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
Keywords
stochastic user equilibrium, perceived cost, route choice model, variational inequalities, fixed point problems, nonlinear programming, traffic assignment

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review