Open AccessSupply-demand optimization in the product distribution process through the branching method
Author(s) -
Valeriana Lukitosari,
Apol Pribadi Subriadi
Publication year - 2021
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/1072/1/012026
Subject(s) - competitor analysis , product (mathematics) , branching (polymer chemistry) , distribution (mathematics) , computer science , supply chain , process (computing) , operations research , mathematical optimization , business , mathematics , marketing , mathematical analysis , materials science , geometry , composite material , operating system
Interaction and relationship between seller-buyer for the availability of certain products always involve the distribution process from suppliers to a number of customers so that demand at each destination is fulfilled. If the product cannot be fulfilled, the customer will find another supplier to meet the product’s shortcomings. Thus the supplier is trying to prevent the supply of other competitors of the same type. Effective logistical arrangements in the distribution of goods need to pay attention to the behavior characteristics of shipping costs. The purpose of this study is to minimize shipping costs with a distribution scheme that can optimize product loads. By using the Balinski linear approach, the problem of sending fixed costs can be solved by the branching method. The branching method gradually produces new problem-solving branches with different objective functions and constraints. Each value branch could be compared so that the optimal solution for the cost is found.