An Equilibrium Dynamic Traffic Assignment Model with Linear Programming Formulation
Abstract
In this paper, we consider a dynamic equilibrium transportation problem. There is a fixed number of cars moving from origin to destination areas. Preferences for arrival times are expressed as a cost of arriving before or after the preferred time at the destination. Each driver aims to minimize the time spent during the trip, making the time spent a measure of cost. The chosen routes and departure times impact the network loading. The goal is to find an equilibrium distribution across departure times and routes. For a relatively simplified transportation model we show that an equilibrium traffic distribution can be found as a solution to a linear program. In earlier works linear programming formulations were only obtained for social optimum dynamic traffic assignment problems. We also discuss algorithmic approaches for solving the equilibrium problem using time-expanded networks.
Cite
@article{arxiv.2408.17196,
title = {An Equilibrium Dynamic Traffic Assignment Model with Linear Programming Formulation},
author = {Victoria Guseva and Ilya Sklonin and Irina Podlipnova and Demyan Yarmoshik and Alexander Gasnikov},
journal= {arXiv preprint arXiv:2408.17196},
year = {2024}
}