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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
