Open AccessImplementation of the Model Capacited Vehicle Routing Problem with Time Windows with a Goal Programming Approach in Determining the Best Route for Goods Distribution
Author(s) -
Wahri Irawan,
Muhammad Manaqib,
Nina Fitriyati
Publication year - 2020
Publication title -
jurnal matematika, statistika dan komputasi/jurnal matematika statistik dan komputasi
Language(s) - English
Resource type - Journals
eISSN - 2614-8811
pISSN - 1858-1382
DOI - 10.20956/jmsk.v17i2.11107
Subject(s) - vehicle routing problem , goal programming , programming paradigm , routing (electronic design automation) , operations research , computer science , total cost , distribution (mathematics) , software , function (biology) , transport engineering , engineering , business , mathematics , embedded system , operating system , mathematical analysis , programming language , accounting , biology , evolutionary biology
This research discusses determination of the best route for the goods distribution from one depot to customers in various locations using the Capacitated Vehicle Routing Problem with Time of Windows (CVRPTW) model with a goal programming approach. The goal function of this model are minimize costs, minimize distribution time, maximize vehicle capacity and maximize the number of customers served. We use case study in CV. Oke Jaya companies which has 25 customers and one freight vehicle with 2000 kg capacities to serve the customers in the Serang, Pandeglang, Rangkasbitung and Cikande. For simulation we use software LINGO. Based on this CVRPTW model with a goal programming approach, there are four routes to distribute goods on the CV. Oke Jaya, which considers the customer’s operating hours, with total cost is Rp 233.000,00, the total distribution time is 17 hours 57 minutes and the total capacity of goods distributed is 6150 kg.