Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum
From MaRDI portal
Publication:2460110
DOI10.1007/S10898-006-9082-4zbMATH Open1179.90070OpenAlexW2040153063MaRDI QIDQ2460110FDOQ2460110
Authors: Artyom Nahapetyan, Siriphong Lawphongpanich 
Publication date: 14 November 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9082-4
Recommendations
- System optimal and user equilibrium time-dependent traffic assignment in congested networks
- scientific article; zbMATH DE number 3858802
- scientific article; zbMATH DE number 1057922
- A linear programming model for the single destination system optimum dynamic traffic assignment problem
- Discrete time dynamic traffic assignment models and solution algorithm for managed lanes
Cites Work
- Network flows. Theory, algorithms, and applications.
- Shock Waves on the Highway
- On kinematic waves II. A theory of traffic flow on long crowded roads
- A linear programming model for the single destination system optimum dynamic traffic assignment problem
- On the existence of solutions to the dynamic user equilibrium problem
- Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
- Optimal Time-Varying Flows on Congested Networks
- A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
- A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models
- Link travel times. I: Desirable properties
- Title not available (Why is that?)
- Solving an Instantaneous Dynamic User-Optimal Route Choice Model
- A Dynamic Traffic Assignment Model and a Solution Algorithm
- Title not available (Why is that?)
- Solving a class of network models for dynamic flow control
- Efficient discretisation for link travel time models
Cited In (16)
- Day-to-day discrete-time traffic assignment model for transport networks affected by disruptive events
- On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks
- Title not available (Why is that?)
- Continuous and discrete trajectory models for dynamic traffic assignment
- Efficient discretisation for link travel time models
- Title not available (Why is that?)
- A cell-based dynamic traffic assignment model: Formulation and properties
- A linear programming model for the single destination system optimum dynamic traffic assignment problem
- Dynamic traffic assignment: Considerations on some deterministic modelling approaches
- Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
- ANALYSIS OF LANE-BLOCKING EVENTS WITH AN ANALYTICAL DYNAMIC TRAFFIC ASSIGNMENT MODEL
- Freight railway operator timetabling and engine scheduling
- System optimal and user equilibrium time-dependent traffic assignment in congested networks
- Discrete time dynamic traffic assignment models and solution algorithm for managed lanes
- The Augmented Lagrangian Method for Solving Dynamic Network Traffic Assignment Models in Discrete Time
- A Cell-Based Traffic Control Formulation: Strategies and Benefits of Dynamic Timing Plans
Uses Software
This page was built for publication: Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460110)
