Penentuan Rute Pengiriman Pupuk Urea Bersubsidi di Karanganyar
:
https://doi.org/10.9744/jti.13.1.11-18Keywords:
Vehicle routing problem, multiple trips, time window, mixed integer linear programming.Abstract
This paper develops a vehicle routing problem (VRP) model for determining the routes in urea fertilizer distribution from a depot to retailers. The distribution is done in work days which uses trucks, each truck can serve more than one route (multiple trips), and each retailer has a time window. The vehicle routing model is built in a mixed integer linear programming (MILP) and the objective function is minimizing total transportation cost. The distances from the distributor to retailers and inter-retailers do not use Euclidian approach but the road network on a digital map in order to make the route solution is more realistic. Historical distribution data was used to test the model. The result shows that the model can minimize the cost about 2.28% which is compared to the original routes.Downloads
Published
2011-06-11
How to Cite
[1]
Y. Priyandari, Y. ., and Y. P. Christiawan, “Penentuan Rute Pengiriman Pupuk Urea Bersubsidi di Karanganyar”, Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri, vol. 13, no. 1, pp. 11-18, Jun. 2011.
Issue
Section
Articles
License
Articles published in the Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri will be Open-Access articles distributed under the terms and conditions of the Creative Commons Attribution License (CC BY).
This work is licensed under a Creative Commons Attribution License (CC BY).