Year: 2023
Type: article
Abstract: Urban road networks have promoted high-quality travel for residents by increasing connectivity and intelligence. But road congestion has not been effectively alleviated, causing a loss of time and energy. At present, the recovery of urban road networks mainly considers removing the failed edges. Considering the recovery cost and time, it is important to take active maintenance behavior to restore these networks. One of the key problems is dispatching traffic workers reasonably to achieve timely maintenance. In this paper, a flow-distribution-based process and execution (FD-PE) model is established for solving congestion. The maintenance centers (MC) study the reasons for and spread of congestion by edge flow. Based on the genetic algorithm (GA), two models of maintenance for urban road networks are developed, which include a single MC-centered dispatching plan and the co-scheduling of MCs. Both models aim at minimizing recovery time and allocating maintenance resources. The road network in Zhengzhou is borrowed as a case to explain the feasibility of the proposed models. The results show that on the premise of dividing network regions, it is reasonable to take a single MC to recover congestion. Compared with a single MC, the co-scheduling of MCs may save more time.
Source: Mathematics
DOI: 10.3390/math11092004
Authors: Hongyan Dui, Yulu Zhang, Songru Zhang, Yun-An Zhang
Language: English
Subfield: Transportation
Field: Social Sciences
Domain: Social Sciences
Open Access status: gold
Estimated APC paid: $2,336
OpenAlex ID: W4366829296