Pendistribusian produk berperan penting dalam dunia industri. Salah satu usaha yang dapat dilakukan perusahaan untuk mengoptimalkan pendistribusian produk adalah meminimalkan biaya tranportasi melalui penentuan rute optimal kendaraan yang disebut dengan VRP (Vehicle Routing Problem). Tujuan dari VRP adalah menentukan rute optimal yaitu rute dengan jarak minimum untuk mendistribusikan produk kepada konsumen. Salah satu variasi VRP adalah Capacitated Vehicle Routing Problem (CVRP), yaitu VRP dengan kendala kapasitas kendaraan. Kasus CVRP tersebut dapat diselesaikan dengan menggunakan Algoritma Tabu Search. Cara kerja Algoritma Tabu Search dimulai dengan penentuan initial solution menggunakan Nearest Neighbor, evaluasi move menggunakan Exchange, 2-Opt, Relocated, dan Cross Exchange, update Tabu List, kemudian apabila kriteria pemberhentian terpenuhi maka proses Algoritma Tabu Search berhenti jika tidak, maka kembali pada evaluasi move. Proses perhitungan Algoritma Tabu Search dilakukan secara manual pada PT IAP. Setiap perusahaan distributor atau pun jasa selalu mengadakan persediaan, salah satunya adalah Safety Stock. Perhitungan sederhana Safety Stock dapat membantu menyelesaikan persediaan pengaman yang harus dipersiapkan perusahaan untuk mengurangi tingkat kerugian. Berdasarkan proses perhitungan manual diperoleh solusi pendekatan optimal yaitu rute dengan total jarak terpendek sebesar 138,834 km dan nilai untuk Safety Stock adalah ± 9 karton.
[Distribution of the product play an important role in the industry field. The effort done by the companies to optimize the distribution is minimize transportation fee by deciding the shortest route of the vehicle, known as Vehicle Routing Problem (VRP). The purpose of VRP is to determine the optimal route of the route with a minimum distance to distribute product to the consumer. One of the varieties of VRP is Capacitated Vehicle Routing Problem (CVRP), which is VRP with vehicle capacity problems. CVRP case can be solved by using Tabu Search Algorithm. How it works Tabu Search Algorithm starts with the determination of the initial solution using the Nearest Neighbor, evaluating the move using Exchange, 2-Opt, Relocated, and Cross Exchange, updates Tabu List, then when the criteria for termination are met then the Tabu Search algorithm stop if not, then go back to the evaluation of the move. Tabu Search Algorithm calculation process is done manually PT IAP. Every distributor or service company always hold inventory, one of them is Safety Stock. The simple calculation of Safety Stock can help solve the safety availability that should be prepared by the companies and reduce the level of losses. Based on the manual calculation process obtained optimal solution approach that is route with the shortest route to the optimal total distance of 138,834 km and the value of safety stock is ± 9 cartons.]
A Hybrid Discrete Differential Evolution Algorithm to Solve the Split Delivery Vehicle Routing Problem
