Optimalisasi Pendistribusian Barang Menggunakan Model Binary Integer Linear Programming pada CV. Padang Jaya

Abstract

The Binary Integer Linear Programming (BILP) model is a mathematical optimization model capable of solving problems hat is able to solve problems with decision variables in the form of binary numbers, namely 0- 1. This model is a development of Linear Programming, namely Integer Linear Programming with the main objective of minimizing or maximizing the objective function through several existing constraints. In the distribution of goods, BILP is able to help determine decisions, such as the selection of distribution routes to minimize distance, time, and cost. This model is applied to CV. Padang Jaya, a business entity engaged in the distri bution of goods in several regions Sumatra, which has been using manual methods and subjective methods in selecting distribution routes. Therefore, the BILP model is used to optimize the distribution of goods. The model solution is done using the Branch and Bound method with the help of LINGO 18.0 unlimited versions software. Based on data processing results, the implementation of the BILP model was able to reduce the total distance traveled by 46 km or approximately 0.54%, reduced travel time by 1.53 hours or approximately 0.54% and achieved cost savings of Rp52,118 or approximately 0.50%. Although this difference seems small in one shipment, it is very significant if the distribution is carried out continuously in the long term.