Dynamic traffic assignment: Considerations on some deterministic modelling approaches
type: Item
instance of: scholarly article
title: Dynamic traffic assignment: Considerations on some deterministic modelling approaches
zbMATH Open document ID: 0839.90028
DOI: 10.1007/BF02031939
published in: Annals of Operations Research
publication date: 1996-03-18T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 93C95
zbMATH DE Number: 847644
zbMATH Keywords: dynamic behaviour of traffic flows
zbMATH Keywords: dynamic assignment
zbMATH Keywords: Wardrop's principle
Wikidata QID: Q61736125
author: Esteve Codina
author: Jaume Barceló
describes a project that uses: MINOS
MaRDI profile type: Publication
cites work: Equilibria on a Congested Transportation Network
cites work: Q3686255
cites work: On control problems with bounded state variables
cites work: The equivalence of some necessary conditions for optimal control in problems with bounded state variables
cites work: Projected Newton Methods for Optimization Problems with Simple Constraints
cites work: Solving an Instantaneous Dynamic User-Optimal Route Choice Model
cites work: Optimal Time-Varying Flows on Congested Networks
cites work: Traffic assignment problem for a general network
cites work: Q3928936
cites work: Introduction to sensitivity and stability analysis in nonlinear programming
cites work: Q4086303
cites work: Nonlinear cost network models in transportation analysis
cites work: Q3292914
cites work: Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
cites work: A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
cites work: Q4070782
cites work: Q4739659
cites work: Q3494537
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: Restricted simplicial decomposition: Computation and extensions
cites work: Nested decomposition for dynamic models
cites work: Simplicial decomposition in nonlinear programming algorithms
cites work: On the spectra of a family of positive matrices
cites work: Q4101601
cites work: An optimal control approach to dynamic routing in networks
cites work: Shortest‐path methods: Complexity, interrelations and new propositions
cites work: Q3285814
cites work: A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models
cites work: On decentralized dynamic routing for congested traffic networks
cites work: Q3696432
full work available at URL: https://doi.org/10.1007/bf02031939
OpenAlex ID: W2066701040
description: scientific article; zbMATH DE number 847644