Masalah Pendistribusian Barang menggunakan Pemrograman Linear Integer

Abstract

One of the important things in determining the distribution of products is searching distribution scenario that minimizes the total travel time from the depot to distributors, where the problem can be modeled as an Integer Linear Programming (ILP). In this work, we implemented the model to a candy company, where we had to deliver products to 5 distributors within 12 periods. Constraints should be considered are distributor inventory level, warehouse capacity, demand-supply balance, expiration date of product, and the maximum duration of each period of delivery. We here assumed that the delivery process to distributors is conducted through a predetermined order. The output of this model includes the retour trip between depot and distributors as well as the delivered amount of products in each period.