Optimal scheduling of logistical support for an emergency roadway repair work schedule

• Published in: Engineering optimization Vol. 44; no. 9; pp. 1035 - 1055
• Main Authors: Yan, S., Lin, C. K., Chen, S. Y.
• Format: Journal Article
• Language: English
• Published: Abingdon Taylor & Francis 01.09.2012; Taylor & Francis Ltd
• Subjects: Algorithms; Disasters; Emergencies; emergency repair work schedule; Heuristic; logistical support scheduling; Logistics; Mathematical models; multiple-commodity network flow problem; Network flow problem; Optimization; Optimization algorithms; Repair; Repair & maintenance; Schedules; Scheduling; Seismic phenomena; time-space network; Taiwan
• ISSN: 0305-215X; 1029-0273
• DOI: 10.1080/0305215X.2011.628389

The completion of every disaster rescue task performed by repair work teams relies on the in-time supply of materials to the rescue workers. Up to now, logistical support planning for emergency repair work in Taiwan has been done manually, which is neither effective nor efficient. To remedy the problem, this study presents a logistical support scheduling model for the given emergency repair work schedule. The objective is to minimize the short-term operating cost subject to time constraints and other related operating constraints. This model is formulated as an integer multiple-commodity network flow problem which is characterized as NP-hard. A heuristic algorithm, based on the problem decomposition and variable fixing techniques, is also proposed to efficiently solve this problem. Computational tests are performed using data from Taiwan's 1999 Chi-Chi earthquake. The results show that the model and the solution algorithm would be useful for the logistical support scheduling.