This paper considers the classical vehicle routing problem (VRP) where the vehicle capacity is not fixed. Indeed, at the moment of acquiring (or renting) the vehicle that will serve all customers, there is some freedom of choice. A larger vehicle capacity implies a lower total distance travelled but larger operating costs. The reverse is true for a smaller vehicle. This paper gives an approach to select the best capacity and the best route to minimize a function of the acquisition cost and travelled distance. We first consider an enumerative approach, which consists of solving a sequence of VRPs, starting from the one having the largest capacity. The number of VRPs to solve using this approach is unknown. Based on computational experiments, this number is mostly large in our benchmark instances. We then proceed to a direct approach based on the two-index formulation of the VRP. We introduce several valid inequalities that allow us to have an integer linear programming formulation of the VRP with fixed vehicle capacity. We describe separation procedures for these inequalities. We conclude with computational results that confirm the utility of these inequalities when solving benchmark VRP instances.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Solving the Single Vehicle Routing Problem with Variable Capacity



    Erschienen in:

    Erscheinungsdatum :

    2016




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch



    Klassifikation :

    Lokalklassifikation TIB:    770/1935/7000
    BKL:    55.80 / 55.80 Verkehrswesen, Transportwesen: Allgemeines



    Solving the Single Vehicle Routing Problem with Variable Capacity

    Louveaux, François V. / Salazar-González, Juan-José | British Library Online Contents | 2016


    Algorithms for Solving the Vehicle Routing Problem with Drones

    Schermer, Daniel / Moeini, Mahdi / Wendt, Oliver | British Library Conference Proceedings | 2018



    A Variable Neighbourhood Search Algorithm for Solving Dynamic Vehicle Routing Problem Under Industry 4.0

    Chen, Shifeng / Yin, Yanlan / Chen, Bo et al. | Springer Verlag | 2021


    Solving a Dynamic Real-Life Vehicle Routing Problem

    Goel, Asvin / Gruhn, Volker | BASE | 2006

    Freier Zugriff