The Traffic Equilibrium Problem with Nonadditive Path Costs

Steven A. Gabriel · David H. Bernstein

165 citations0/0 files storedTransportation Science

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 Optimization and Variational Analysis

Abstract

In this paper we present a version of the (static) traffic equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classic additivity assumption fails. We describe existence and uniqueness conditions for this problem, and we also present convergence theory for ageneric algorithm for solving nonadditive problems.

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 — 165 citations exist upstream.

Cited by

2000Traffic equilibrium problem with route-specific costs: formulation and algorithms 2010C-logit stochastic user equilibrium model: formulations and solution algorithm 2009A network equilibrium model with travellers’ perception of stochastic travel times 2003Modeling transfer and non-linear fare structure in multi-modal network 2006A multiclass, multicriteria logit-based traffic equilibrium assignment model under ATIS 2004Equilibrium, Games, and Pricing in Transportation and Telecommunication Networks 2012Path-Constrained Traffic Assignment 2001Assessing Performance Reliability of Road Networks Under Nonrecurrent Congestion

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