An Equilibrium Dynamic Traffic Assignment Model with Linear Programming Formulation
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929479471857664 |
|---|---|
| author | Guseva, Victoria Sklonin, Ilya Podlipnova, Irina Yarmoshik, Demyan Gasnikov, Alexander |
| author_facet | Guseva, Victoria Sklonin, Ilya Podlipnova, Irina Yarmoshik, Demyan Gasnikov, Alexander |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_17196 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An Equilibrium Dynamic Traffic Assignment Model with Linear Programming Formulation Guseva, Victoria Sklonin, Ilya Podlipnova, Irina Yarmoshik, Demyan Gasnikov, Alexander Optimization and Control Computer Science and Game Theory 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. |
| title | An Equilibrium Dynamic Traffic Assignment Model with Linear Programming Formulation |
| topic | Optimization and Control Computer Science and Game Theory |
| url | https://arxiv.org/abs/2408.17196 |