Please use this identifier to cite or link to this item:
http://repository.ipb.ac.id/handle/123456789/111780
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Supriyo, Prapto Tri | - |
dc.contributor.advisor | Silalahi, Bib Paruhum | - |
dc.contributor.author | Tanjung, Edon Primindo Firdaus | - |
dc.date.accessioned | 2022-05-18T02:42:49Z | - |
dc.date.available | 2022-05-18T02:42:49Z | - |
dc.date.issued | 2022 | - |
dc.identifier.uri | http://repository.ipb.ac.id/handle/123456789/111780 | - |
dc.description.abstract | Capacitated Vehicle Routing Problem (CVRP) merupakan salah satu variasi dari Vehicle Routing Problem (VRP) dengan kapasitas angkut kendaraan sebagai kendala yang dihadapi. Ada beberapa metode yang dapat digunakan untuk menyelesaikan permasalahan ini. Pada karya ilmiah ini, digunakan algoritme Clarke-Wright dan algoritme genetika untuk menyelesaikan CVRP. Pada tahap pertama algoritme Clarke-Wright digunakan untuk pembentukan grup dari sejumlah pelanggan berdasarkan konsep penghematan jarak. Tahap kedua digunakan algoritme genetika untuk penentuan rute pendistribusian di setiap grup yang sudah terbentuk. Model diimplementasikan pada pendistribusian roti. Hasil implementasi model memperlihatkan algoritme yang diusulkan lebih baik dibandingkan dengan algoritme greedy. | id |
dc.description.abstract | Capacitated Vehicle Routing Problem (CVRP) is a variation of Vehicle Routing Problem (VRP) with the vehicle carrying capacity as an obstacle. There are several methods that can be used to solve this problem. In this scientific work, the Clarke-Wright algorithm and genetic algorithm are used to solve CVRP. In the first step, the Clarke-Wright algorithm is used to form groups of a number of customers based on the concept of distance saving. In the second step, genetic algorithms are used to determine the distribution route in each group that has been formed. The model is implemented in bread product delivery. The result of model implementation shows that the proposed algorithm is better than the greedy algorithm. | id |
dc.language.iso | id | id |
dc.publisher | IPB University | id |
dc.title | Penyelesaian Capacitated Vehicle Routing Problem Menggunakan Algoritme Clarke-Wright dan Algoritme Genetika | id |
dc.type | Undergraduate Thesis | id |
dc.subject.keyword | Clarke-Wright algorithm | id |
dc.subject.keyword | CVRP | id |
dc.subject.keyword | genetic algorithm | id |
Appears in Collections: | UT - Mathematics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Cover.pdf Restricted Access | Cover | 564.65 kB | Adobe PDF | View/Open |
G54170006_Edon Primindo FT.pdf Restricted Access | Fullteks | 2.01 MB | Adobe PDF | View/Open |
Lampiran.pdf Restricted Access | Lampiran | 1.26 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.