An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm

The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem. We fill this research gap by proposing an optimal schedule for urban road network repair with limited repair resources based on the greedy algorithm. Critical links will be given priority in repair according to the basic concept of the greedy algorithm. In this study, the link whose restoration produces the ratio of the system-wide travel time of the current network to the worst network is the minimum. We define such a link as the critical link for the current network. We will re-evaluate the importance of damaged links after each repair process is completed. That is, the critical link ranking will be changed along with the repair process because of the interaction among links. We repair the most critical link for the specific network state based on the greedy algorithm to obtain the optimal schedule. The algorithm can still quickly obtain an optimal schedule even if the scale of the road network is large because the greedy algorithm can reduce computational complexity. We prove that the problem can obtain the optimal solution using the greedy algorithm in theory. The algorithm is also demonstrated in the Sioux Falls network. The problem discussed in this paper is highly significant in dealing with urban road network restoration.

[1]  T. Killingback,et al.  Attack Robustness and Centrality of Complex Networks , 2013, PloS one.

[2]  Zhong-Ke Gao,et al.  Multivariate weighted complex network analysis for characterizing nonlinear dynamic behavior in two-phase flow , 2015 .

[3]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[4]  H. W. Corley,et al.  Most vital links and nodes in weighted networks , 1982, Oper. Res. Lett..

[5]  Shih-Wei Lin,et al.  Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic , 2009, Expert Syst. Appl..

[6]  Federico Rupi,et al.  Ranking Links in a Road Transport Network: A Practical Method for the Calculation of Link Importance , 2015 .

[7]  Jain-Shing Wu,et al.  Greedy-search-based multi-objective genetic algorithm for emergency logistics scheduling , 2014, Expert Syst. Appl..

[8]  Fritz Gehbauer,et al.  Optimized resource allocation for emergency response after earthquake disasters , 2000 .

[9]  Jin Li,et al.  Multiple-resource and multiple-depot emergency response problem considering secondary disasters , 2012, Expert Syst. Appl..

[10]  J G Wardrop,et al.  CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[11]  Irina S. Dolinskaya,et al.  Network repair crew scheduling and routing for emergency relief distribution problem , 2016, Eur. J. Oper. Res..

[12]  Alan T. Murray,et al.  Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure , 2010, Comput. Oper. Res..

[13]  Linet Özdamar,et al.  Coordinating debris cleanup operations in post disaster road networks , 2014 .

[14]  Alan T. Murray,et al.  Strategic Network Restoration , 2010 .

[15]  Majid Salari,et al.  A bi-level programming model for protection of hierarchical facilities under imminent attacks , 2015, Comput. Oper. Res..

[16]  Jiang Fu.  Study on the Relative Importance of Links in Urban Roads Network , 2004 .

[17]  Darren M. Scott,et al.  Identifying Critical Road Segments and Measuring System-Wide Robustness in Transportation Networks with Isolating Links: A Link-Based Capacity-Reduction Approach , 2010 .

[18]  Linet Özdamar,et al.  A mathematical model for post-disaster road restoration: Enabling accessibility and evacuation , 2014 .

[19]  Illya V. Hicks,et al.  Optimization procedures for simultaneous road rehabilitation and bridge replacement decisions in highway networks , 2002 .

[20]  Licinio da Silva Portugal,et al.  Determining Critical Links in a Road Network: Vulnerability and Congestion Indicators☆ , 2014 .

[21]  Zhongke Gao,et al.  A directed weighted complex network for characterizing chaotic dynamics from time series , 2012 .

[22]  Li Shuang-li.  User Equilibrium-based Post-earthquake Relief Routing Problems under Traffic Control , 2014, IEEM 2014.

[23]  Zhong-Ke Gao,et al.  Multi-frequency complex network from time series for uncovering oil-water flow structure , 2015, Scientific Reports.

[24]  Darren M. Scott,et al.  Network Robustness Index : a new method for identifying critical links and evaluating the performance of transportation networks , 2006 .

[25]  Richard L. Church,et al.  A bilevel mixed-integer program for critical infrastructure protection planning , 2008, Comput. Oper. Res..

[26]  Jungyul Sohn,et al.  Evaluating the significance of highway network links under the flood damage: An accessibility approach , 2006 .

[27]  Enrico Nardelli,et al.  Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes , 1998, Inf. Process. Lett..

[28]  Alan T. Murray,et al.  Exploring the vulnerability of network infrastructure to disruption , 2008 .

[29]  Gwo-Hshiung Tzeng,et al.  A Fuzzy Multi-objective Model for Reconstructing the Post-quake Road-network by Genetic Algorithm , 1999 .

[30]  Kuo-Ching Ying,et al.  Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic , 2010, Expert Syst. Appl..

[31]  Chi Ho Yeung,et al.  Recovery of infrastructure networks after localised attacks , 2016, Scientific Reports.