Linear programming formulation for strategic dynamic traffic assignment

DOI10.1007/s11067-013-9187-5zbMath1332.90161OpenAlexW1999082274MaRDI QIDQ264276

Melissa Duell, S. Travis Waller, David Fajardo, Vinayak V. Dixit

Publication date: 31 March 2016

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-013-9187-5

zbMATH Keywords

linear programmingdemand uncertaintydynamic traffic assignment

Mathematics Subject Classification ID

Linear programming (90C05) Traffic problems in operations research (90B20)

Related Items (3)

A continuous DUE algorithm using the link transmission model ⋮ Arrival time reliability in strategic user equilibrium ⋮ Day-to-day evolution model based on dynamic reference point with heterogeneous travelers

Uses Software

• pyuvdata

Cites Work

• Unnamed Item
• User equilibrium with recourse
• Optimal routing for maximizing the travel time reliability
• A strategic model for dynamic traffic assignment
• A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks
• Stochastic shortest paths with recourse
• An algorithm for the equilibrium assignment problem with random link times
• On the online shortest path problem with limited arc cost dependencies
• Stochastic shortest path problems with recourse
• Dynamic Processes and Equilibrium in Transportation Networks: Towards a Unifying Theory
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs

This page was built for publication: Linear programming formulation for strategic dynamic traffic assignment