A Genetic Algorithm for the Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes
In this paper, a genetic algorithm for the multi-compartment vehicle routing problem with continuously flexible compartment sizes is proposed. In this problem, supplies of several product types have to be collected from customer locations and transported to a depot at minimal cost. In order to avoid mixing of different product types which are transported in the same vehicle, the vehicle’s capacity can be separated into a limited number of compartments. The size of each compartment can be selected arbitrarily within the limits of the vehicle’s capacity, and in each compartment one or several supplies of the same product type can be transported.
For solving this problem, a genetic algorithm is presented. The performance of the proposed algorithm is evaluated by means of extensive numerical experiments. Furthermore, the economic benefits of using continuously flexible compartments are investigated.
Copyright (c) 2016 Working Paper Series
Dieses Werk steht unter der Lizenz Creative Commons Namensnennung - Weitergabe unter gleichen Bedingungen 4.0 International.