ON THE EXPANSION OF THE WAREHOUSE BASE IN THE CONSIDERED ECONOMIC AREA WITH PARALLEL DETERMINATION OF THE OPTIMAL LOGISTICS WORK

Abstract

This article proposes a comprehensive solution of three linear programming problems: Transport problem (logistics problem), Maximum flow problem, Center allocation problem. Similar tasks in the proposed complex formulation often arise at enterprises in the process of making decisions on expanding the warehouse base with the subsequent determination of the optimal process for the operation of warehouses as points of shipment to the consumer. The basic algorithms for finding optimal solutions are considered, a complex task is formulated, a model is built and a solution algorithm is implemented, and comparison of the existing method and author's method is carried out. The proposed model can be used in any enterprise where it is necessary to find the best combinatory variantfor delivery in order to minimize the cost of transporting of the finished product. Such a task corresponds exactly to the economic situations when an enterprise will have to deliver products using a known transport infrastructure, taking into account the cost of transportation. The task that we have solved appearedfor the first time at a timber processing enterprise. Such a problem is non-trivial combinatorial.