OPTIMALISASI RUTE DISTRIBUSI AIR MINUM QUELLE DENGAN ALGORITMA CLARKE & WRIGHT SAVING DAN MODEL VEHICLE ROUTING PROBLEM
Main Author: | Febriana, Nuzullia |
---|---|
Format: | Thesis NonPeerReviewed Book |
Bahasa: | ind |
Terbitan: |
, 2016
|
Subjects: | |
Online Access: |
https://eprints.untirta.ac.id/11458/1/OPTIMALISASI%20RUTE%20DISTRIBUSI%20AIR%20MINUM%20QUELLE%20DENGAN%20ALGORITMA%20CLARKE%20%26%20WRIGHT%20SAVING%20DAN%20MODEL%20VEHICLE%20ROUTING%20PR~1.pdf https://eprints.untirta.ac.id/11458/ |
Daftar Isi:
- Distribution is one of the most important part in the company that may be based on customer satisfaction. In the matter of the distribution often occurs late, one of the causes of various problems of delay was not optimal distribution routes. The purpose of this research is to design a distribution route based on algorithm of Clarke and Wright Saving Heuristics, designing the route of distribution with the model completion of the Vehicle Routing Problem using Software LINGO and choosing 9.0 optimal route based on algorithm of Clarke and Wright Saving Heuristics and distribution routes with a model settlement of Vehicle Routing Problem using Software LINGO9.0 by considering the utility of vehicle. The problems at the company was the use of inefficient vehicle and mileage are not effective on routes of distribution of products owned by the company Quelle thus need to be evaluated. The method used was algorithm Algorithm Clarke and Wright Saving Heuristics and model completion of Vehicle Routing Problem. Distribution routes generated with algorithms carke & wright are the three routes with the total mileage 180.7 km, the route with the model completion of the Vehicle Routing Problem generated three routes with a total distance of 115.63 km, so that the obtained results the model route vehicle routing problem is optimal routes where with the reduction of the distance distribution company of 72, 47km. Key Words: Algoritma Clarke and Wright Saving Heuristik, Distribution Routes, software LINGO 9.0,Vehicle Routing Problem