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.


    Access

    Download

    Check availability in my library


    Export, share and cite



    Title :

    A Genetic Algorithm for the Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes


    Contributors:

    Publication date :

    2016


    Remarks:

    Working paper series, ISSN 2628-1724, 2016, Heft 4



    Type of media :

    Miscellaneous


    Type of material :

    Electronic Resource


    Language :

    Unknown



    The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes

    Henke, Tino / Speranza, M. Grazia / Wäscher, Gerhard | DataCite | 2014


    A Branch-and-Cut Algorithm for the Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes

    Henke, Tino / Speranza, M.Grazia / Wäscher, Gerhard | BASE | 2018

    Free access

    A Multi-Compartment Vehicle Routing Problem with Loading and Unloading Costs

    Hübner, Alexander / Ostermeier, Manuel | British Library Online Contents | 2019


    Electrical coupling for first compartment of multi-compartment vehicle

    SUNDBERG RICHARD / WESTMAN ANDERS / RADICH ISTVAN | European Patent Office | 2023

    Free access