Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem
type: Item
instance of: scholarly article
title: Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem
author: Ovidiu D. Bagdasar
author: Stuart Berry
author: Sam O'Neill
author: Nicolae Popovici
author: R. Raja
published in: Mathematics and Computers in Simulation
publication date: 2021-03-02T00:00:00Z
Mathematics Subject Classification ID: 90Cxx
Mathematics Subject Classification ID: 49Jxx
zbMATH DE Number: 7316564
zbMATH Keywords: traffic assignment
zbMATH Keywords: optimal flow
zbMATH Keywords: equilibrium flow
zbMATH Keywords: Tabu search
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: j.matcom.2018.08.004
OpenAlex ID: W2888919419
cites work: Q4640024
cites work: Nonlinear Programming
cites work: Q4420427
cites work: Traffic assignment problem for a general network
cites work: Q3701188
cites work: Worst-case equilibria
cites work: A survey on the continuous nonlinear resource allocation problem
cites work: On the convergence of descent methods for monotone variational inequalities
cites work: Pareto reducible multicriteria optimization problems
DOI: 10.1016/J.MATCOM.2018.08.004
Recommended article: Traffic assignment: on the interplay between optimization and equilibrium problems
Recommended article: A framework for and empirical study of algorithms for traffic assignment
Recommended article: Q4526914
Recommended article: Dynamic traffic assignment: Considerations on some deterministic modelling approaches
Recommended article: A variational inequality formulation of the dynamic traffic assignment problem
Recommended article: Q4495161
Recommended article: A dual scheme for traffic assignment problems
Recommended article: A partial linearization method for the traffic assignment problem
Recommended article: Q3372288
description: scientific article; zbMATH DE number 7316564