The multi-compartment vehicle routing problem with flexible compartment sizes

• The paper deals with a new variant of the multi-compartment vehicle routing problem.
• A mathematical model for this problem is formulated.
• A variable neighborhood search algorithm to solve this problem is proposed.
• Extensive numerical experiments based on randomly-generated instances and instances from practice were conducted.

In this paper, a capacitated vehicle routing problem is discussed which occurs in the context of glass waste collection. Supplies of several different product types (glass of different colors) are available at customer locations. The supplies have to be picked up at their locations and moved to a central depot at minimum cost. Different product types may be transported on the same vehicle, however, while being transported they must not be mixed. Technically this is enabled by a specific device, which allows for separating the capacity of each vehicle individually into a limited number of compartments where each compartment can accommodate one or several supplies of the same product type. For this problem, a model formulation and a variable neighborhood search algorithm for its solution are presented. The performance of the proposed heuristic is evaluated by means of extensive numerical experiments. Furthermore, the economic benefits of introducing compartments on the vehicles are investigated.