Implementation of the Model Capacited Vehicle Routing Problem with Time Windows with a Goal Programming Approach in Determining the Best Route for Goods Distribution

Abstract

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.

Pengembangan Aplikasi Penentuan Rute Pengiriman Barang Berdasarkan Berat dan Time Windows Menggunakan Metode Nearest Neighbour dan Tabu Search

“…) merupakan salah satu model matematika yang dapat menyelesaikan permasalahan pendistribusian barang pada sistem transportasi dengan tujuan untuk menemukan rute perjalanan dengan biaya yang minimum dalam pendistribusian barang [1]. Terdapat beberapa jenis VRP salah satunya adalah CVRPTW yang merupakan kombinasi antara CVRP (Capacitated Vehicle Routing Problem) dan VRPTW (Vehicle Routing Problem with Time Windows).…”