PENYELESAIAN CAPACITATED VEHICLE ROUTING PROBLEM (CVRP) (Studi Kasus Di PT. Trijaya Abadi Sentausa)
| Main Author: | Trianto, Agus |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2018
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/43529/1/PENDAHULUAN.pdf http://eprints.umm.ac.id/43529/2/BAB%20I.pdf http://eprints.umm.ac.id/43529/3/BAB%20II.pdf http://eprints.umm.ac.id/43529/4/BAB%20III.pdf http://eprints.umm.ac.id/43529/5/BAB%20IV.pdf http://eprints.umm.ac.id/43529/6/BAB%20V.pdf http://eprints.umm.ac.id/43529/7/BAB%20VI.pdf http://eprints.umm.ac.id/43529/8/LAMPIRAN.pdf http://eprints.umm.ac.id/43529/ |
Daftar Isi:
- The distribution of a product very important and is a factor that must be considered the company to send products to consumers. In order for the distribution of run efficiently and effectively it is necessary to note distribution channels, the number of customer demand, and the capacity of transport means of transport used. In determining the distribution model generally known as VRP (Vehicle Routing Problem). The objective of the VRP is determining the optimal route is the route with the minimum distance for distributing products to consumers. One variant VRP is Capacitated Vehicle Routing Problem (CVRP), the VRP with each vehicle constraints have limited capacity and the same. The vehicle had to serve the demand of each customer to a distributor that generates minimum mileage. Distribution of LPG cylinders is one example of the problem CVRP, so it will serve as an example the case in this study. The purpose of this study is the use Saving matrix formation. Furthermore, these are formed from Saving Matrix will be repaired using Tabu Search algorithm.