Adaptasi Algoritma Harmony Search Untuk Menyelesaikan Capacitated Vehicle Routing Problem (Cvrp) Dengan Permintaan Dinamis

Ramadhani, Dinan Fakhrana (2017) Adaptasi Algoritma Harmony Search Untuk Menyelesaikan Capacitated Vehicle Routing Problem (Cvrp) Dengan Permintaan Dinamis. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.

[img]
Preview
Text
1213100111-Undergraduate_Theses.pdf - Published Version

Download (6MB) | Preview

Abstract

Capacitated vehicle routing problem (CVRP) merupakan permasalahan pencarian rute terbaik untuk mendistribusikan barang kepada sejumlah pelanggan menggunakan kendaraan yang memiliki kapasitas terbatas. CVRP merupakan permasalahan np-hard yang berarti diperlukan suatu metode untuk dapat menghasilkan solusi penyelesaian yang optimal dengan waktu komputasi lebih cepat. Pertama, pada penelitian ini terdapat dua kasus, kasus pertama adalah CVRP dengan letak depot berada di pinggir dan kasus kedua letak depotnya berada ditengah dengan masing-masing memiliki koordinat depot, koordinat 70 pelanggan, kapasitas kendaraan, dan permintaan setiap pelanggan. Kemudian, dicari rute terpendek untuk melayani pelanggan yang memiliki permintaan. Pada penelitian ini, CVRP dengan permintaan dinamis diselesaikan dengan algoritma harmony search, GA¬-based clustering algorithm, dan algoritma hybrid harmony search. Hasil yang didapatkan yaitu algortima hybrid harmony search dapat digunakan untuk menyelesaikan CVRP dengan permintaan dinamis dan menghasilkan solusi yang baik dibandingkan dengan algoritma harmony search, dan GA¬-based clustering algorithm. ============================================================================================== Capacitated vehicle routing problem (CVRP) is a matter of finding the best route to distribute goods to a number of customers using vehicles with limited capacity. CVRP is a np-hard problem which means a method is needed that can produce an optimal solution with faster computation time. First, in this research there are two cases, the first case is the CVRP with the location of the depot is on the edge and the second case where the depot is located in the middle. Each case contains coordinate of depot, coordinate of 70 customers, vehicle capacity, and demand of each customers. Then, search for the shortest route to serve customers who have requests. In this study, CVRP with dynamic demands solved by GA-based clustering algorithm, harmony search algorithm and hybrid harmony search algorithm. The results is hybrid harmony search algorithm can be used to solved CVRP with dynamic demands and produce a good solution, while harmony search algorithm and GA-based clustering can not produce a good solution.

Item Type: Thesis (Undergraduate)
Additional Information: RSMa 515.243 3 Ram a-1
Uncontrolled Keywords: CVRP, permintaan dinamis, algoritma harmony search, algoritma genetika, algoritma hybrid harmony search
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science. EDP
Q Science > QA Mathematics > QA76.87 Neural networks (Computer Science)
Q Science > QA Mathematics > QA278 Cluster Analysis. Multivariate analysis
Divisions: Faculty of Mathematics and Science > Statistics > (S1) Undergraduate Theses
Depositing User: Dinan Fakhrana Ramadhani
Date Deposited: 11 Dec 2017 04:36
Last Modified: 06 Mar 2019 03:41
URI: http://repository.its.ac.id/id/eprint/47131

Actions (login required)

View Item View Item