The Multi-Compartment Multi-Vehicle Routing Problem

The multi-compartment vehicle routing problem (MCVRP) frequently arises in practical applications where different products need to be handled or kept differently. Where the MCVRP uses a fleet of identical vehicles, this research uses a non-homogeneous fleet of vehicles. This extends the MCVRP to the multi-compartment multi-vehicle routing problem (MCMVRP). We get solutions for both the MCVRP and the MCMVRP by means of an iterated tabu search algorithm proposed by Silvestrin and Ritt (2017). We find that in general the non-homogeneous fleet composition does not find better solutions than a fleet of identical vehicles.