Vehicle Routing Problem (VRP) is an operational management problem in the field of distribution and logistics. In VRPs, routes have to be designed starting from a depot to the geographically spread customer zones with an objective to minimize distance or cost and fulfilling the customer demands. The customers are assigned to a route without violating the capacity of the vehicle. Heterogeneous fleet vehicle routing problem is a kind of VRP that uses vehicles with different capacity. In this study, the real data is obtained from one of the major distribution agency that distributes the Liquefied Petroleum Gas (LPG) cylinders in a Northern district of Kerala. The heterogeneous vehicle routing problem is solved by using Clarke and Wright Algorithm and the solution is compared with that of LINGO solution.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Solving a Heterogeneous Fleet Vehicle Routing Model - A practical approach


    Contributors:


    Publication date :

    2018-07-01


    Size :

    436243 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet

    Dominguez, Oscar / Juan, Angel A. / Barrios, Barry et al. | Springer Verlag | 2014



    Heterogeneous fleet green vehicle routing problem: a literature review

    Normasari, Nur Mayke Eka / Lathifah, Nurul | BASE | 2021

    Free access

    Heterogeneous Fleet Vehicle Routing Optimization with Consideration of Carbon Emission

    Wang, Heng / Jin, Shiyu / Tian, Dechun et al. | Springer Verlag | 2019