An Adaptive Large Neighborhood Search for the Multiple Traveling Salesman Problem With Backup Coverage
The Multiple Traveling Salesman Problem with Backup Coverage (mTSP-BC) is a vehicle routing variant in which all vehicles must remain within a maximum pairwise distance at every instant during their traversal, imposing spatiotemporal interdependence among routes. This constraint models real-world scenarios such as mili...