Modeling and visualization of generalized minimum cost flows problems

• Date: 2018
• Main Authors: Dodonov, E. O., Dodonov, O. G., Kuzmychov, A. I.
• Format: Article
• Language: Ukrainian
• Published: Інститут проблем реєстрації інформації НАН України 2018
• Subjects: flows in minimal cost networks; one- and multicommodity flows; minimum cost flow problem; minimal cost network flows; optimization modeling with spreadsheets
• Online Access: http://drsp.ipri.kiev.ua/article/view/158489
• Journal Title: Data Recording, Storage & Processing

Modeling the minimal cost flows is, really, the research on the models of any type or principle of operation of all communications, natural or artificial, by which network flows are transmitted or must be transmitted in such a way that the total costs for the movement of energy, funds or resources, were the least. So the core of the mathematical and computing instruments of network optimization is the model of the fundamental problem of minimum cost flow (MCF) in its various versions, statements and applications. Usually the implementation of these models requires serious efforts and costs associated with the use of special software and language tools.Some examples of solving generalized MSF problems on accessible technology of spreadsheet op-timization modeling are given.In these examples it has been proved the possibility of studying complicated statements of the problem of minimum cost flows, in particular, in the K-product version, taking into account specific costs (resources, resources, time) in nodes. This opportunity opens the way for the development of specialized software for transport and logistics services for optimal management solutions to meet customer orders.