Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum

DOI10.1007/s10898-006-9082-4zbMath1179.90070OpenAlexW2040153063MaRDI QIDQ2460110

Siriphong Lawphongpanich, Artyom Nahapetyan

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

zbMATH Keywords

Dynamic traffic assignmentSystem optimumTime-varying network flows

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Traffic problems in operations research (90B20)

Related Items (2)

Freight railway operator timetabling and engine scheduling ⋮ Discrete time dynamic traffic assignment models and solution algorithm for managed lanes

Uses Software

• NEOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving a class of network models for dynamic flow control
• Link travel times. I: Desirable properties
• Efficient discretisation for link travel time models
• 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 Dynamic Traffic Assignment Model and a Solution Algorithm
• 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
• Shock Waves on the Highway
• Solving an Instantaneous Dynamic User-Optimal Route Choice Model
• On kinematic waves II. A theory of traffic flow on long crowded roads

This page was built for publication: Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum