Abstract
Urban road maintenance is an important part of urban traffic management. However, in modern cities, road maintenance work needs to occupy some traffic resources; therefore, unreasonable road maintenance schemes often lead traffic networks to unexpected large-scale congestion. In this paper, a dynamic programming model is proposed in order to minimize the delay caused by road maintenance scheme. This model can obtain a globally optimal maintenance scheme which contains the decisions and sequence for every stage of maintenance. Each stage of this model can be boiled down to a discrete network design problem. This model helps make suggestions for the traffic managers with the request of minimizing the delay caused by the maintenance scheme. This paper uses two examples to illustrate this method, one is a small-scale Nguyen-Dupuis network, and the other one is a larger scale Sioux-Falls network.
Document type: Article
Full document
Original document
The different versions of the original document can be found in:
- http://downloads.hindawi.com/journals/jat/2018/4539324.pdf under the license https://creativecommons.org/licenses/by
- http://dx.doi.org/10.1155/2018/4539324 under the license cc-by
- http://downloads.hindawi.com/journals/jat/2018/4539324.xml,
- http://dx.doi.org/10.1155/2018/4539324 under the license http://creativecommons.org/licenses/by/4.0
Document information
Published on 01/01/2018
Volume 2018, 2018
DOI: 10.1155/2018/4539324
Licence: Other
Share this document
Keywords
claim authorship
Are you one of the authors of this document?