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.


    Access

    Download

    Check availability in my library


    Export, share and cite



    Title :

    The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes


    Contributors:

    Publication date :

    2014


    Remarks:

    Working papers series, ISSN 2628-1724, 2014, Heft 6



    Type of media :

    Miscellaneous


    Type of material :

    Electronic Resource


    Language :

    Unknown




    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