E-ARCP: An exact solution approach to the Collaborative Multi-vehicle Prize Collecting Arc Routing for Connectivity Problem

The Collaborative Multi-Vehicle Arc Routing for Connectivity Problem (MPC-ARCP) is an optimization problem that determines the roads that should be unblocked to reconnect communities that were cut off after a natural disaster. In the MPC-ARCP, isolated communities are linked to critical infrastructures (e.g. ports and airports) according to a prioritization criterion. This paper introduces E-ARCP - a software designed to solve the MPC-ARCP to optimality and to display the results in a network. This software is easily adaptable to other Arc Routing for Connectivity Problems with great reuse potential by researchers working in the field of network repair and restoration.& COPY; 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

Automated summary

MPC-ARCP is an optimization problem that aims to determine the roads to unblock for reconnecting isolated communities after a natural disaster. E-ARCP is a software designed to solve MPC-ARCP and display network results, with great potential for reuse in network repair and restoration research.