Open AccessClustering for Items Distribution Network
Author(s) -
Mokhammad Ridwan Yudhanegara,
Sapto Wahyu Indratno,
R R K N Sari
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1496/1/012019
Subject(s) - cluster analysis , computer science , cluster (spacecraft) , vertex (graph theory) , data mining , graph , theoretical computer science , artificial intelligence , computer network
The distribution network can be represented as a simple graph. In this case, the delivery destination location is represented as a vertex, while the road passed is represented as an arc. The main concept of network clustering or graph clustering is that high connected vertices can be in the same cluster, while low connected vertices can be in different clusters. The method for network clustering in this paper is the Markov cluster. The purpose of items distribution network clustering i.e. to facilitate the company in item delivery based on road conditions.