An aggrandized solution is designed for the vehicles to reduce the total cost of distribution by which it can supply the goods to the customers with its known capacity can be named as a vehicle routing problem. In variable neighborhood search method, mainly an efficient vehicle routing can be achieved by calculating the distance matrix value based on the customer's location or the path where the customer's resides. The main objective of the paper is to reduce the total distance travelled to deliver the goods to the customers. The proposed algorithm is a hierarchy based enhanced agglomerative clustering algorithm technique which is used in the data mining scenario effectively. The proposed algorithm decreases the total distance assigning to each route and the important thing need to consider is that, this enhanced clustering algorithm can reduce the total distance when compared to the previously proposed variable neighborhood search method. V. Praveen | V. Hemalatha | M. Poovizhi "An Enhanced Agglomerative Clustering Algorithm for Solving Vehicle Routing Problem" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-6 , October 2017, URL: https://www.ijtsrd.com/papers/ijtsrd4701.pdf


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    An Enhanced Agglomerative Clustering Algorithm for Solving Vehicle Routing Problem


    Beteiligte:
    V. Praveen (Autor:in) / V. Hemalatha (Autor:in) / M. Poovizhi (Autor:in)

    Erscheinungsdatum :

    04.10.2017


    Anmerkungen:

    oai:zenodo.org:3580249
    International Journal of Trend in Scientific Research and Development 1(6) 919-924



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    629




    Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

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

    Freier Zugriff

    Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm

    Azad, Utkarsh / Behera, Bikash K. / Ahmed, Emad A. et al. | IEEE | 2023


    Solving Vehicle Routing Problem with Time Windows by Genetic Algorithm

    Jiang, Dali / Zhang, Mingshan / Wang, Feng | ASCE | 2002


    Solving Vehicle Routing Problem with Time Windows by Genetic Algorithm

    Jiang, D. / Zhang, M. / Wang, F. et al. | British Library Conference Proceedings | 2002


    Solving Close-Open Mixed Vehicle Routing Problem Using Bat Algorithm

    Amalia, Atika Dwi Hanun / Suprajitno, Herry / Pratiwi, Asri Bekti | BASE | 2020

    Freier Zugriff