Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis

Adel Dabah

We show that the Vehicle Routing Problem (VRP) can be reformulated as a Graph Edit Distance (GED) maximization problem. Under a simple edge-deletion cost model, minimizing total ro…