Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance (doi:10.34820/FK2/DOCE82)

View:

Part 1: Document Description
Part 2: Study Description
Part 5: Other Study-Related Materials
Entire Codebook

Document Description

Citation

Title:

Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance

Identification Number:

doi:10.34820/FK2/DOCE82

Distributor:

Telkom University Dataverse

Date of Distribution:

2022-07-14

Version:

1

Bibliographic Citation:

Purba Daru Kusuma; Meta Kallista, 2022, "Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance", https://doi.org/10.34820/FK2/DOCE82, Telkom University Dataverse, V1

Study Description

Citation

Title:

Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance

Identification Number:

doi:10.34820/FK2/DOCE82

Authoring Entity:

Purba Daru Kusuma (Telkom University)

Meta Kallista (Telkom University)

Distributor:

Telkom University Dataverse

Access Authority:

DARU KUSUMA, PURBA

Depositor:

DARU KUSUMA, PURBA

Date of Deposit:

2022-07-14

Study Scope

Keywords:

Computer and Information Science

Abstract:

This work aims to minimize the total travel distance and the number of unserved customers in single routing cycle. The solution is developed by combining the stable marriage algorithm and k-means clustering in the clustering process. The nearest neighbour algorithm is used in the routing process.

Methodology and Processing

Sources Statement

Data Access

Notes:

CC0 Waiver

Other Study Description Materials

Related Publications

Citation

Bibliographic Citation:

P. D. Kusuma and M. Kallista, "Multi-Depot Capacitated Vehicle Routing Problem by Using Stable Marriage and K-Means Clustering to Minimize Number of Unserved Customers and Total Travel Distance", International Journal of Intelligent Engineering and Systems, 14(6), 605-615, 2021.

Other Study-Related Materials

Label:

ijies_published_multidepotvrp.pdf

Notes:

application/pdf