Ristiani, . (2017) Optimasi rute pengiriman produk cv rst untuk meminimumkan jarak tempuh kendaraan dan biaya transportasi. Masters thesis, Institut Pertanian Bogor.
|
Text
R53-01-Ristiani-Cover.pdf - Published Version Download (393kB) | Preview |
|
|
Text
R53-02-Ristiani-Ringkasan.pdf - Published Version Download (289kB) | Preview |
|
|
Text
R53-03-Ristiani-Summary.pdf - Published Version Download (292kB) | Preview |
|
|
Text
R53-04-Ristiani-Daftarisi.pdf - Published Version Download (426kB) | Preview |
|
|
Text
R53-05-Ristiani-Pendahuluan.pdf - Published Version Download (393kB) | Preview |
|
![[img]](http://repository.sb.ipb.ac.id/style/images/fileicons/text.png) |
Text
Tesis full.pdf Restricted to Registered users only Download (1MB) |
Abstract
Distribution and transportation problems become important due to the large proportions of the costs for distribution activities in logistics management. Regarding to the contribution, it is necessary to improve the efficiency of transportation by optimizing the use of transportation equipments and personnels. Knowledge concerning the determination of the routes is the main component of the transportation problems which must be evaluated and improved in order to solve transportation problems. This problem is generally known as Vehicle Routing Problem (VRP). The distribution system of CV RST that has currently been applied is renting a fleet of the vehicles to deliver goods to the customers. The amount of the hired vehicles is adjusted to the amount of the customers, means one vehicle is rented to deliver goods to one customer or named One-to-One Relationship because the capacity of the hired vehicle is limited. Distribution with that rental system cause the high transportation cost and this system is not efficient due to the different hired cost for each customer. The purpose of this paper is to design VRP in to integer linear programming form and to devise the optimal route of the product distribution. It aims to minimize the mileage and the hired vehicle cost. A case study as descriptive method was used to obtain primary and secondary data. These data were analized by exact approach and the branch-and-bound algorithm solved the model. Given five scenarios of the fleet under different capacity, which are three heterogenous and two homogenous vehicle scenarios. The scenario for the fleet velocity are the optimistic and the pesimistic scenario. The output clarified the global optimum solution for scenario 1 and 2, whereas scenario 3, 4 and 5 obtained the feasible solution. The feasible solutions have been selected due to the elapsed runtimes and their impact to the hired vehicle time and cost have been analyzed in advance of deciding to consider the solution worthiness for the company. Scenario 2 required the longer elapsed runtime than scenario 1 because it had more integer variables and constraints. It was highlighted that scenario 3 and 5 had the similar value of the objective, i.e., 2877.9 as they had the identical integer variable and the fleet combination. The result explained when the firm apply the heterogenous vehicle scenarios, the hired vehicle cost can be decreased a minimum of 8.7 percent and a maximum of 38.5 percent. On the other hand, the value of savings in the homogenous vehicle scenarios is larger, i.e., 14.4 percent to 37.2 percent. If there is an additional rental fee at certain times, the calculation of the extra fee is expected to not ultimately cause the hired vehicle cost exceeds the previous one. The maximum additional rental fee varies for each fleet capacity scenario. The largest additional rental cost can occur in scenario 3 and 5, allowed to IDR 6 hundred thousands. However, it needs as well to meet the criteria of the optimistic scenario. The company can adjust one of the fleet capacity scenarios depends on its goal, the shortest mileage or the largest savings cost. Proposed scenarios can be implemented with assumptions there is no time windows and significant changes in total demand. The sensitivity of additional rental fee needs to be considered in terms of savings, as well. Regarding the effectiveness the road network associated with the travel time and cost, the company can initiate to ponder investing asset (fleet) for its distribution activities. This research has resulted in several scientific informations related to optimize the product delivery route of CV RST. However, some things can be suggested from this study, including: the development of heuristic method, sensitivity analysis of changes in total demand, additional time windows constraint, and research on fleet investments
| Item Type: | Thesis (Masters) |
|---|---|
| Uncontrolled Keywords: | branch-and-bound, distribusi, pendekatan eksak, rute, VRP, Vehicle Routing Problem branch-and-bound, distribution, exact approach, route, VRP |
| Subjects: | Manajemen Produksi dan Operasi |
| Depositing User: | SB-IPB Library |
| Date Deposited: | 15 Feb 2018 06:43 |
| Last Modified: | 15 Feb 2018 06:43 |
| URI: | http://repository.sb.ipb.ac.id/id/eprint/2990 |
Actions (login required)
 |
View Item |
