An optimization model for a capacitated multivehicle covering tour problem on a road network graph and an application to waste collection

We consider a bi-level waste collection problem in which each resident brings the waste to a 74collection site of their preference located in the neighborhood and trucks collect the waste there. Given a set of (potential) collection points, the goal is to select a subset of (actual) collection points so that each resident has one in their neighborhood and the resulting total collection time is minimized. We propose a compact mixed-integer linear programming formulation that exploits the sparsity of the road network and compare it with a formulation relying on the classical network representation in vehicle routing problems.