Results of the numerical experiments of the proposed MIP to the Collaborative Multi-vehicle Prize Collecting Arc Routing for Connectivity Problem

The Collaborative Multi-Vehicle Prize Collecting Arc Routing for Connectivity Problem (MPC-ARCP) is a new problem in the field of road network repair and restoration in the context of humanitarian operations. The problem considers that earthquakes and other disasters can cover roads with debris and block them. Therefore, vulnerable communities may be disconnected from critical infrastructures (e.g. ports and airports). The blocked roads can hamper emergency activities such as the distribution of relief supplies, and the evacuation of victims. Souza Almeida et al. (2022) introduce the MPC-ARCP and proposes a Mixed Integer Programming model to solve this problem. In addition, they perform a series of numerical experiments on academic instances. This database contains the instances used in the tests performed by Souza Almeida et al. (2022), as well as the results (i.e. log files and the values of the decision variables) of each one of the experiments.

Souza Almeida, Luana; Ghasemi, Alireza; Goerlandt, Floris. The Collaborative Multi-vehicle Prize Collecting Arc Routing for Connectivity Problem. 2022. Submitted.