In this research we develop a novel time-space network model with the objective of minimizing the length of time needed for emergency repair, subject to related operating constraints. The model is expected to help the decision maker to efficiently set an emergency repair schedule within a limited time. Our model is an integer network flow problem with side constraints. To efficiently solve realistically large problems in practice, we develop a heuristic algorithm. To evaluate our model and the solution algorithm, we exhibit a case study. The results show that the model and the solution algorithm could be useful in practice.
|Number of pages||13|
|Journal||Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an|
|State||Published - 2007|
- Emergency repair
- Integer network flow problem with side constraints
- Time-space network