Optimasi Rute Pengiriman dengan Heterogeneous Fleet Vehicle Routing Problem with Time Windows

  • Edwin Hendrawan Petra Christiant University
  • I Gede Agus Widyadana Petra Christiant University
Abstract views: 453 , PDF downloads: 273

Abstract

PT. X is a distributor of spare parts with 128 customers for Surabaya City and Sidoarjo City. Number of delivery vehicles owned by PT. X is 15. Determination of delivery route owned by PT. X is completed manually based on driver experience. This research is to make a model of determining the route with minimum cost by considering the travel time and the capacity of the vehicle. Model formation is accomplished in accordance with the PT X policy that each colleague can only be served by one vehicle and the maximum shipping time of 7 hours. The model formed is Heterogeneous Fleet Vehicle Routing Problem with Time Windows (HFVRPWTW). The settlement method used is Evolutionary Algorithm (EA) by reviewing 3 cases. The number of vehicles decreased by the model is  with an average difference of 1.67 vehicles. The shipping cost generated by the model is lower than the company for case 1 of 3,155 IDR and case 2 of 25,005 IDR. This condition indicates the model will use less number of vehicles with low shipping costs and large container utilities in 2 cases.

Downloads

Download data is not yet available.

References

B. L. Golden, S. Raghavan, and E. A. Wasil, The vehicle routing problem: latest advances and new challenges, vol. 43. Springer Science & Business Media, 2008.

Published
2018-07-27
How to Cite
[1]
E. Hendrawan and I. G. A. Widyadana, “Optimasi Rute Pengiriman dengan Heterogeneous Fleet Vehicle Routing Problem with Time Windows”, j. sist. manaj. ind., vol. 2, no. 1, pp. 1-8, Jul. 2018.
Section
Articles