Optimization Solutions of a Multistage Balanced Transport Problem with using of the Potential Method

¹ 1Lviv Polytechnic National University, Department of Artificial Intelligence, Kniazia Romana Street, 5, Lviv, 79905, Ukraine
² Kingston University, Faculty of Engineering, Computing and the Environment, Kingston, London, Room RV MB 104, Main Building (RV), Roehampton Vale
³ Lviv Polytechnic National University, Department of Designing and Operated of Machines, S. Bandera, str., 12, Lviv, 79013, Ukraine
⁴ Lviv State University of Life Safety, Department of Project Management, Information Technologies and Telecommunications, Kleparivska str., 35, Lviv, 79007, Ukraine

^* Corresponding author: solomiya.y.lyaskovska@lpnu.ua

Abstract

Route optimization is an important issue because it allows improving the economic component in production. Its generalization to optimization problems on networks is shown. The transport task is formulated in the network setting: to make a plan of cargo trans-portation on the transport network so that the cargo stocks were taken out of the points of depar-ture, the needs of consumers at the destinations were met, and the total cost of transportation was minimal. The algorithm of its solution is given, revealed on a concrete example of delivery of products to customers who sell these products on a daily basis. Tables of the basic and optimal plan, a transport network of the optimal plan of transportations are made. The process of solving such a problem by modeling in the environment is proposed. The simulation model of this process was created with using the FlexSim software. The process of creating the simulation model is demonstrated