An Equilibrium Dynamic Traffic Assignment Model with Linear Programming Formulation
<|reference_start|>An Equilibrium Dynamic Traffic Assignment Model with Linear Programming Formulation: 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.<|reference_end|>
@article{guseva2024an,
    title={An Equilibrium Dynamic Traffic Assignment Model with Linear Programming
  Formulation},
    author={Victoria Guseva, Ilya Sklonin, Irina Podlipnova, Demyan Yarmoshik,
  Alexander Gasnikov},
    journal={arXiv preprint arXiv:2408.17196},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.17196},
    primaryClass={math.OC cs.GT}
}