Real-Time Vehicle Routing for Repairing Damaged Infrastructures Due to Natural Disasters

We address the task of repairing damaged infrastructures as a series of multidepot vehicle-routing problems with time windows in a time-rolling frame. The network size of the tackled problems changes from time to time, as new disaster nodes will be added to and serviced disaster nodes will be deleted from the current network. In addition, an inaccessible disaster node would become accessible when one of its adjacent disaster nodes has been repaired. By the “take-and-conquer” strategy, the repair sequence of the disaster nodes in the affected area can be suitably scheduled. Thirteen instances were tested with our proposed heuristic, that is, Chen et al.'s approach. For comparison, Hsueh et al.'s approach (2008) with necessary modification was also tested. The results show that Chen et al.'s approach performs slightly better for larger size networks in terms of objective value