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.


    Access

    Download


    Export, share and cite



    Title :

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


    Contributors:
    Evi Yuliza (author) / F.M Puspita (author)


    Publication date :

    2019




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    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

    Free access

    Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

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

    Free access



    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