Capacitated Vehicle Routing Problem (CVRP) is a problem that discusses how to choose several routes that must be passed by a number of transport vehicles in the process of distributing goods that combine customer demand with regard to transport capacity. CVRP designs an optimal delivery route where each vehicle only takes one route, each vehicle has the same characteristics, each customer has a request and there is only one depot. In this paper, two CVRP models were formulated. Formulation of the first CVRP model without regard to vehicle loads and vehicles returned to the depot. The second CVRP model formulation takes into account the vehicle load and the vehicle does not return to the depot. Determination of LPG gas distribution routes is completed using the Branch and Cut method.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    The Branch and Cut Method for Solving Capacitated Vehicle Routing Problem (CVRP) Model of LPG Gas Distribution Routes


    Beteiligte:
    Evi Yuliza (Autor:in) / F.M Puspita (Autor:in)


    Erscheinungsdatum :

    2019




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt


    Schlagwörter :


    A matheuristic algorithm for the three dimensional loading capacitated vehicle routing problem (3L-CVRP)

    Luis Miguel Escobar-Falcón / David Álvarez-Martínez / Mauricio Granada-Echeverri et al. | BASE | 2016

    Freier Zugriff


    Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

    AbdElAziz, Moh. M. / A. El-Ghareeb, Haitham / Ksasy, M. S. M. | BASE | 2014

    Freier Zugriff

    Capacitated vehicle routing problem model for carriers

    Irma-Delia Rojas-Cuevas / Santiago-Omar Caballero-Morales / Jose-Luis Martinez-Flores et al. | DOAJ | 2018

    Freier Zugriff

    An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem

    Achuthan, N. R. / Caccetta, L. / Hill, S. P. | British Library Online Contents | 2003