The authors did consider the problem of finding the optimal placement of storage areas for the shops inside one retail chain. The authors have presented algorithms for finding the optimal placement of stock in one of the shops, in order to minimize transport costs. The result of the calculation gives reason to decide in what store is cheaper and easier to place the warehouse.

Keywords: shortest path; cost minimization; warehouse; Dijkstra’s algorithm; Kruskal’s algorithm.

References

1. Revyakin A. M., Bardushkina I. V. Matematicheskie metody modelirovaniya v ekonomike (Mathematical Modeling Methods in Economics), M., MIET, 2013, 328 p.
2. Revyakin A. M., Bardushkina I. V., Tereshchenko A. M. Matematicheskie metody i modeli v issledovanii operatsii (Mathematical Methods and Models in Operational Research), M., ITs MGADA, 2013, 264 p.
3. Matematicheskie metody prinyatiya reshenii i setevye modeli v upravlenii i ekonomike (Mathematicak Methods of Decision Making and Network Models in Administration and Economics), I. N. Abanina , V. V. Bardushkin , I. V. Bardushkina i dr., pod obshch. red. I. N. Abaninoi, A. M. Revyakina, M., ITs MGADA, 2014, 176 p.
4. Isachenko A. N., Revyakin A. M. Matroidy v matematicheskom modelirovanii ekonomicheskikh sistem (Matroids in Mathematical Modeling of Economic Systems), Ekonomicheskie i sotsial’no-gumanitarnye issledovaniya, 2015, No. 1 (5), pp. 13—18.