Work2013

A computational study of traffic assignment algorithms

Olga Perederieieva · Matthias Ehrgott · Judith Y.T. Wang · Andrea Raith

7 citations0/0 files storedWhite Rose Research Online (University of Leeds, The University of Sheffield, University of York)

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

Traffic congestion is an issue in most cities worldwide. One way to model and analyse the effect of congestion and other factors on route choice behaviour and to predict the impact of traffic management projects and transport policies is traffic assignment (TA). The most commonly used TA model is known as user equilibrium (UE), which is based on the assumption that all drivers want to minimise their travel time or generalised cost. As a result, an equilibrium is achieved when no one has an incentive to switch to another route. Although the conventional mathematical model of TA belongs to the convex optimisation domain and, hence, is relatively easy to solve, efficient algorithms are required in order to be able to solve TA in a reasonable amount of time for realistic transport networks. This motivates researchers to propose numerous methods and algorithms to solve this problem in the literature. However, there is no comprehensive empirical study that compares the performance of different approaches on benchmark instances. In this study, our objective is to fill this gap. We provide a literature review of the most promising methods. We classify algorithms according to the way the solution is represented, namely, link-based (solution is represented by link flows), path-based (solution is represented by path flows) and origin-based (solution is represented by link flows corresponding to each origin), and implement the most representative algorithms in each group. We perform numerical tests on benchmark instances of various sizes, compare the algorithms and analyse the impact of their main components on their running time. We also study the convergence behaviour of the methods with respect to different levels of solution accuracy.

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

References

1986Urban transportation networks: Equilibrium analysis with mathematical programming methods 1994The Traffic Assignment Problem: Models and Methods 1969Traffic assignment problem for a general network 2002Origin-Based Algorithm for the Traffic Assignment Problem 1982The Convergence of Equilibrium Algorithms with Predetermined Step Sizes 1992Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem 2006A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration 1994A FASTER PATH-BASED ALGORITHM FOR TRAFFIC ASSIGNMENT

Cited by

2015Numerical stability of path-based algorithms for traffic assignment

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.