Dynamic traffic assignment: Considerations on some deterministic modelling approaches
From MaRDI portal
DOI10.1007/BF02031939zbMATH Open0839.90028OpenAlexW2066701040WikidataQ61736125 ScholiaQ61736125MaRDI QIDQ1908277FDOQ1908277
Publication date: 18 March 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02031939
Transportation, logistics and supply chain management (90B06) Application models in control theory (93C95)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
- Optimal Time-Varying Flows on Congested Networks
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
- A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models
- Traffic assignment problem for a general network
- Introduction to sensitivity and stability analysis in nonlinear programming
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Equilibria on a Congested Transportation Network
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Simplicial decomposition in nonlinear programming algorithms
- Shortest‐path methods: Complexity, interrelations and new propositions
- An optimal control approach to dynamic routing in networks
- The equivalence of some necessary conditions for optimal control in problems with bounded state variables
- On control problems with bounded state variables
- On the spectra of a family of positive matrices
- Restricted simplicial decomposition: Computation and extensions
- Solving an Instantaneous Dynamic User-Optimal Route Choice Model
- Nested decomposition for dynamic models
- Nonlinear cost network models in transportation analysis
- On decentralized dynamic routing for congested traffic networks
Cited In (12)
- Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem
- Title not available (Why is that?)
- DTA2012 symposium: Combining disaggregate route choice estimation with aggregate calibration of a dynamic traffic assignment model
- A strategic model for dynamic traffic assignment
- Modeling Decisions for the Time-Dependent Optimal Lane Configuration Policy with Queueing Theory and Mathematical Programming
- Selecting predictors for traffic control by methods of the mathematical theory of democracy
- Day-to-day assignment models and traffic dynamics under information provision
- A demand model with departure time choice for within-day dynamic traffic assignment
- An exit-flow model used in dynamic traffic assignment
- Mitigating End Effects in the Dynamic Vehicle Allocation Model
- Discrete time dynamic traffic assignment models and solution algorithm for managed lanes
- Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights
Uses Software
Recommendations
- A cell-based dynamic traffic assignment model: Formulation and properties 👍 👎
- Some consistency conditions for dynamic traffic assignment problems 👍 👎
- Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum 👍 👎
- Modelling dynamic network loading ontransportation networks through a continuous 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Dynamic traffic assignment: Considerations on some deterministic modelling approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908277)