A hierarchical clustering and routing procedure for large scale disaster relief logistics planning

We describe a hierarchical cluster and route procedure (HOGCR) for coordinating vehicle routing in large-scale post-disaster distribution and evacuation activities. The HOGCR is a multi-level clustering algorithm that groups demand nodes into smaller clusters at each planning level, enabling the optimal solution of cluster routing problems. The routing problems are represented as capacitated network flow models that are solved optimally and independently by CPLEX on a parallel computing platform. The HOGCR preserves the consistency among parent and child cluster solutions obtained at consecutive levels. We assess the performance of the algorithm by using large scale scenarios and find satisfactory results.

► Hierarchical method is developed for logistics of large scale post disaster relief. ► Top level model is solved to assign depots and hospitals to demand cluster centers. ► Detailed routing decisions for each cluster are optimized using network flow model. ► Relief activities with networks up to 900 nodes are coordinated successfully. ► Scenarios show that procedure obtains solutions within 12% above the lower bound.