<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances.</p>
</abstract>

A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances.

Work Zone Scheduling Problem in the Urban Traffic Networks

Economic Themes

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

{"article-title":"Work Zone Scheduling Problem in the Urban Traffic Networks"}

A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street...

Work Zone Scheduling Problem in the Urban Traffic Networks

Publicado en línea: 15 abr 2023

Páginas: 1 - 18

Recibido: 14 dic 2022

Aceptado: 30 ene 2023

DOI: https://doi.org/10.2478/ethemes-2023-0001

Palabras clave
Work Zones, Traffic Assignment, Combinatorial Optimization, Incremental algorithm

© 2023 Dušan Teodorović et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Work Zone Scheduling Problem in the Urban Traffic Networks

Publicado en línea: 15 abr 2023

Páginas: 1 - 18

Recibido: 14 dic 2022

Aceptado: 30 ene 2023

DOI: https://doi.org/10.2478/ethemes-2023-0001

Palabras claveWork Zones, Traffic Assignment, Combinatorial Optimization, Incremental algorithm

© 2023 Dušan Teodorović et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Palabras clave
Work Zones, Traffic Assignment, Combinatorial Optimization, Incremental algorithm