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

Abstract

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.

Keywords

• Mixed integer programming
• Network connectivity
• Arc routing
• Emergency operations
• Natural hazard