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

Authors:
Artyom Nahapetyan;Siriphong Lawphongpanich
Affiliations:
Center for Applied Optimization, Industrial and Systems Engineering Department, University of Florida, Gainesville, USA 32611-6595;Center for Applied Optimization, Industrial and Systems Engineering Department, University of Florida, Gainesville, USA 32611-6595
Venue:
Journal of Global Optimization
Year:
2007

Citing 9
Cited 2

Optimal time-varying flows on congested networks

Operations Research
Dynamic network traffic assignment considered as a continuous time optimal control problem

Operations Research
A new class of instantaneous dynamic user-optimal traffic assignment models

Operations Research
A variational inequality formulation of the dynamic network user equilibrium problem

Operations Research
A Whole-Link Travel-Time Model with Desirable Properties

Transportation Science
On the Existence of Solutions to the Dynamic User Equilibrium Problem

Transportation Science
A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem

Transportation Science
An Analytical Model for Traffic Delays and the Dynamic User Equilibrium Problem

Operations Research
Convergence of a Discretised Travel-Time Model

Transportation Science

Congestion Pricing for Schedule-Based Transit Networks

Transportation Science
Discrete time dynamic traffic assignment models and solution algorithm for managed lanes

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a system optimal dynamic traffic assignment model that does not require the network to be empty at the beginning or at the end of the planning horizon. The model assumes that link travel times depend on traffic densities and uses a discretized planning horizon. The resulting formulation is a nonlinear program with binary variables and a time-expanded network structure. Under a relatively mild condition, the nonlinear program has a feasible solution. When necessary, constraints can be added to ensure that the solution satisfies the First-In-First-Out condition. Also included are approximation schemes based on linear integer programs that can provide solutions arbitrarily close to that of the original nonlinear problem.