| dc.description.abstract | When built a new road, maintaining its service level and make road users pass unimpeded is the most important purpose of road maintenance. In addition to the disaster prevention of daily routine inspection and maintenance, when encountering natural disasters or other emergencies, the work team that deal with emergency is also plays an important role. They need to complete temporary repairs in the shortest time to prevent the potholes from continuing to expand over time and use. Most of the emergency repair work schedule in the past were focus on the road blocking constraints and the optimization of logistical support, however, those properties are not similar with this case. In this case, the road emergency repair work team is playing the role of emergency repair team and logistical support at the same time, therefore, the model is difficult to apply to this case.
Hence, we employ network flow techniques, with a systemic optimization perspective and the objective of minimizing the total system cost, as well as the related operating constraints, to construct a deterministic road emergency repair scheduling model. Furthermore, this model is formulated as an integer multiple-commodity network flow problem which is characterized as NP-hard. In order to efficiently solve realistically large problems occurring
in practice, we use a problem decomposition technique a, coupled with the use of a mathematical programming solver CPLEX, to develop a heuristic algorithm. Then, the numerical tests are performed using the first maintenance office data associated with Taoyuan City , Taiwan. Referring to the actual case of the double typhoons Nisha and Begonia in 2017, three case study of different sizes were designed for evaluate the model and the solution algorithm in practice. At last, conclusions and suggestions will be given. | en_US |