ALGORITMA SEQUENTIAL INSERTION UNTUK MENYELESAIKAN MASALAH VEHICLE ROUTING PROBLEM ( STUDI KASUS DI PT. BLAMBANGAN FOODPACKERS INDONESIA)
| Main Author: | Alifi, Firman |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2018
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/43717/1/PENDAHULUAN.pdf http://eprints.umm.ac.id/43717/2/BAB%20I.pdf http://eprints.umm.ac.id/43717/3/BAB%20II.pdf http://eprints.umm.ac.id/43717/4/BAB%20III.pdf http://eprints.umm.ac.id/43717/5/BAB%20IV.pdf http://eprints.umm.ac.id/43717/6/BAB%20V.pdf http://eprints.umm.ac.id/43717/7/BAB%20VI.pdf http://eprints.umm.ac.id/43717/ |
Daftar Isi:
- Vehicle Routing Problem (VRP) is a problem solving in determining the route for a number of vehicles that are at one or more depots so that they can serve the largest consumers. Efficiency that occurs in the distribution and transportation patterns of products can provide a significant contribution to the reduction in products’ cost; so that it can increase the profit and the competitiveness of a company. PT. Blambangan Food Packers Indonesia is a company engaged in canning sardines, canning tuna, making fish meatballs, nuggets and fish meal. VRP problems are by solved using sequential insertion algorithms. The route search process in the algorithm in this study starts with selecting the initial customer (seed customer) with the criteria of the farthest distance from the depot, followed by finding the shortest distance from the seed of the customer. This process is carried out until all customers have been visited, so that the data processing results in a number of tours with the final result obtained is the minimum number of vehicles with several alternative vehicles that is seen from the total distance and consumption of the smallest distribution costs.