| dc.contributor.advisor | Buulolo, Faigiziduhu | |
| dc.contributor.advisor | Sitorus, Syahriol | |
| dc.contributor.author | Damanik, Donna | |
| dc.date.accessioned | 2022-12-23T07:29:55Z | |
| dc.date.available | 2022-12-23T07:29:55Z | |
| dc.date.issued | 2015 | |
| dc.identifier.uri | https://repositori.usu.ac.id/handle/123456789/77245 | |
| dc.description.abstract | Model to choose vehicle route is known as Vehicle Routing Problem (VRP). VRP
is related to optimal routing problem that involve more than one vehicle of each
capacity to serve costumer’s demand. Capacitated Vehicle Routing Problem is
one of VRP form which each of vehicle has finite capacity. Solution in this
research use Clarke and Wright’s Savings Algorithm. This algorithm may get a
route depand to vehicle capacity and customer’s demand. Data that use in this
research is distance between source and customer, between each customer,
customer’s demand and vehicle’s capacity. In this research, the resolution of
CVRP by using Clarke and Wright’s Savings Algorithm. From the results of the
solution by using Clarke and Wright’s Savings Algorithm obtained 5 optimal
route with vehicles of different capacities. | en_US |
| dc.language.iso | id | en_US |
| dc.publisher | Universitas Sumatera Utara | en_US |
| dc.subject | Vehicle Routing Problem (VRP) | en_US |
| dc.subject | Capacitated Vehicle Routing Problem (CVRP) | en_US |
| dc.subject | Clarke and Wright’s Savings Algorithm | en_US |
| dc.title | Implementasi Algoritma Clarke And Wright’s Savings dalam Menyelesaikan Capacitated Vehicle Routing Problem (CVRP). | en_US |
| dc.type | Thesis | en_US |
| dc.identifier.nim | NIM110803063 | |
| dc.identifier.nidn | NIDN0018125301 | |
| dc.identifier.nidn | NIDN0010037104 | |
| dc.identifier.nik | KODEPRODI44201#Matematika | |
| dc.description.pages | 52 Halaman | en_US |
| dc.description.type | Skripsi Sarjana | en_US |
