Penentuan Rute Pengiriman Pupuk Urea Bersubsidi di Karanganyar
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.Metrics
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Â