Adyan Nur Alfiyatin
Brawijaya University

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

K-Means Clustering and Genetic Algorithm to Solve Vehicle Routing Problem with Time Windows Problem Adyan Nur Alfiyatin; Wayan Firdaus Mahmudy; Yusuf Priyo Anggodo
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 2: August 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v11.i2.pp462-468

Abstract

Distribution is an important aspect of industrial activity to serve customers on time with minimal operational cost. Therefore, it is necessary to design a quick and accurate distribution route. One of them can be design travel distribution route using the k-means method and genetic algorithms. This research will combine k-means method and genetic algorithm to solve VRPTW problem. K-means can do clustering properly and genetic algorithms can optimize the route. The proposed genetic algorithm employs initialize chromosome from the result of k-means and using replacement method of selection. Based on the comparison between genetic algorithm and hybrid k-means genetic algorithm proves that k-means genetic algorithm is a suitable combination method with relative low computation time, are the comparison between 2700 and 3900 seconds.