Accès ouvert · CC BY

K-MEDOID PETAL-SHAPED CLUSTERING FOR THE CAPACITATED VEHICLE ROUTING PROBLEM

Article scientifique 2021 Sciences de l'ingénieur et technologies Anglais

Résumé

In this research, k-medoid clustering is modelled and evaluated for the capacitated vehicle routing problem (CVRP). The k-medoid clustering method creates petal-shaped clusters, which could be an effective method to create routes in the CVRP. To determine routes from the clusters, an existing metaheuristic — the ruin and recreate (R&R) method — is applied to each generated cluster. The results are benchmarked to those of a well-known clustering method, k-means clustering. The performance of the methods is measured in terms of travel cost and distance travelled, which are well-known metrics for the CVRP. The results show that k-medoid clustering method outperforms the benchmark method for most instances of the test datasets, although the CVRP without any predefined clusters still provides solutions that are closer to optimal. Clustering remains a reliable distribution management tool and reduces the processing requirements of large-scale CVRPs.

Citer ce document

Bührmann, J. H., & Bruwer, F. (2021). K-MEDOID PETAL-SHAPED CLUSTERING FOR THE CAPACITATED VEHICLE ROUTING PROBLEM. The South African Journal of Industrial Engineering. https://doi.org/10.7166/32-3-2610

Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)

Accès au document

Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter

Voir l'article sur le site de la revue

Licence et provenance

Licence : CC BY

Notice moissonnée depuis OpenAlex le 05/09/2026. Le document reste hébergé par sa source.
Voir le document à la source →

Statistiques

Consultations (hors robots) : 8

Téléchargements (hors robots) : 0

Méthode de comptage