In this paper an unsupervised clustering method for the Capacited Vehicle Routing Problem is proposed. Advantages and disadvantages of the proposed algorithm are weighed, and comparisons are made to some clustering algorithms commonly used in the literature to tackle routing problems. Experimental tests were performed using Solomon and Hering/Homberger benchmarks applied to different distributions. The proposed algorithm is demonstrated as effective for the attempted problem, with the ability to improve upon weaknesses in some of the clustering algorithms in the literature.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Unsupervised Clustering Method for the Capacited Vehicle Routing Problem




    Erscheinungsdatum :

    01.11.2012


    Format / Umfang :

    385816 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    An Enhanced Agglomerative Clustering Algorithm for Solving Vehicle Routing Problem

    V. Praveen / V. Hemalatha / M. Poovizhi | BASE | 2017

    Freier Zugriff

    Clustering algorithm for a vehicle routing problem with time windows

    Thi Diem Chau Le / Duc Duy Nguyen / Judit Oláh et al. | DOAJ | 2022

    Freier Zugriff

    Vehicle Routing Problem

    Balaji, Bharathan | DataCite | 2024


    Vehicle Routing Problem

    Wang, Yong / Ma, Xiaolei / Lao, Yunteng et al. | Transportation Research Record | 2013


    Vehicle Routing Problem

    Liu, Baoding | Springer Verlag | 2009