K-MEDOID PETAL-SHAPED CLUSTERING FOR THE CAPACITATED VEHICLE ROUTING PROBLEM
DOI:
https://doi.org/10.7166/32-3-2610Abstract
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.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish in the Journal agree to the following terms:- Authors retain copyright and grant the Journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this Journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the Journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this Journal.
