A Path‐Based Algorithm for the Cross‐Nested Logit Stochastic User Equilibrium Traffic Assignment

Shlomo Bekhor · Tomer Toledo · Lena Reznikova

55 citations0/0 files storedComputer-Aided Civil and Infrastructure Engineering

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Traffic control and management Vehicle Routing Optimization Methods

Abstract

Abstract: This article investigates the single-class static stochastic user equilibrium (SUE) problem with separable and additive link costs. A SUE assignment based on the Cross-Nested Logit (CNL) route choice model is presented. The CNL model can better represent route choice behavior compared to the Multinomial Logit (MNL) model, while keeping a closed form equation. The article uses a specific optimization formulation developed for the CNL model, and develops a path-based algorithm for the solution of the CNL-SUE problem based on adaptation of the disaggregate simplicial decomposition (DSD) method. The article illustrates the algorithmic implementation on a real size network and discusses the trade-offs between MNL-SUE and CNL-SUE assignment.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

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

Citations in this library

Citation map →

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

References

1999Discrete Choice Methods and their Applications to Short Term Travel Decisions 1977On Stochastic Models of Traffic Assignment 1980Some developments in equilibrium traffic assignment 1996A MODIFIED LOGIT ROUTE CHOICE MODEL OVERCOMING PATH OVERLAPPING PROBLEMS. SPECIFICATION AND SOME CALIBRATION RESULTS FOR INTERURBAN NETWORKS 1982An algorithm for the equilibrium assignment problem with random link times 2002NETWORK KNOWLEDGE AND ROUTE CHOICE 1992Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem 1998Link-Nested Logit Model of Route Choice: Overcoming Route Overlapping Problem

Cited by

2013Computation and application of the paired combinatorial logit stochastic user equilibrium problem 2020Simulation-based dynamic traffic assignment: Meta-heuristic solution methods with parallel computing 2012A self-adaptive Armijo stepsize strategy with application to traffic assignment models and algorithms 2021Demand-responsive passenger flow control strategies for metro networks considering service fairness and passengers’ behavioural responses

Explore the map →

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

Imported from OpenAlex (CC0) — nothing here is generated.