Features in solving individual tasks to develop service-oriented networks using dynamic programming

Authors

DOI:

https://doi.org/10.15587/1729-4061.2023.274144

Keywords:

sorting solutions, linear objective function, constraints, Bellman optimality principle, synthesis, optimization, discrete quantity, sensor, monitoring, emergency

Abstract

The object of this study is an approach to solving the problems of designing service-oriented networks that warn about emergencies using dynamic programming. The main issue is the complexity of algorithmization of processes that describe the achievement of an optimal solution in multi-stage nonlinear problems. The possibilities of applying the Bellman optimality principle for solving the set tasks for the purpose of their application in the field of engineering and technology are determined. Based on the Bellman functional equation, a model of the optimal number of sensors in the monitoring system for warning of emergencies was built.

A feature of the design is that using the classical Bellman equation, it is proposed to solve problems of various technical directions, provided that the resource determines what exactly makes it possible to optimize work in any way. Important with this approach is the planning of the action as an element of some problem with the augmented state. After that, the proposed structure in formal form extends to other objects.

A problem was proposed and considered, which confirmed the mathematical calculations, as a result of which an optimal plan for replacing the sensors of the system was obtained; and the possibilities of significant cost reduction were identified. In the considered example, an optimal plan for replacing the system sensors was compiled and the possibility of reducing costs by 31.9 % was proved.

The proposed option was used in the development of information technology for modeling a service-oriented network based on energy-efficient long-range protocols; some of the identified features were further developed in the design of a recommendation system for issuing loans and developing an interactive personnel training system

Author Biographies

Olha Kryazhych, Institute of Telecommunications and Global Information Space of National Academy of Sciences of Ukraine; Ternopil Ivan Puluj National Technical University

PhD, Senior Researcher

Department of Natural Resources

Associate Professor

Victoria Itskovych, Institute of Telecommunications and Global Information Space of National Academy of Sciences of Ukraine; Kyiv City State Administration

Postgraduate Student, Deputy Director of Department – Head of Department

Department for Digitalization, Strategic Development of the Field of Digitalization and Information Security

Department of Natural Resources

Department of Information and Communication Technologies of Executive Body of Kyiv City Council

Kateryna Iushchenko, Institute of Telecommunications and Global Information Space of National Academy of Sciences of Ukraine

Postgraduate Student

Department of Information and Communication Technologies

Oleksii Kuprin, Institute of Telecommunications and Global Information Space of National Academy of Sciences of Ukraine

Postgraduate Student

Department of Information and Communication Technologies

References

  1. Minu, M. (1990). Matematicheskoe programmirovanie. Teoriia i algoritmy. Moscow: Nauka. Gl. red. fiz.mat. lit., 488.
  2. Dreyfus, S. (2002). Richard Bellman on the Birth of Dynamic Programming. Operations Research, 50 (1), 48–51. doi: https://doi.org/10.1287/opre.50.1.48.17791
  3. Bellman, R. E, Kalaba, R. E. (1959). Dynamic Programming and Feedback Control. RAND Corporation, 1778.
  4. Dreyfus, S. (2003). Richard Ernest Bellman. International Transactions in Operational Research, 10 (5), 543–545. doi: https://doi.org/10.1111/1475-3995.00426
  5. Kamien, M. I., Schwartz, N. L. (1991). Dynamic Optimization: The Calculus of Variations and Optimal Control in Economics and Management. Amsterdam: Elsevier, 259–263.
  6. Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C. (2001). Introduction to Algorithms. MIT Press & McGraw-Hill, 1184.
  7. Giegerich, R., Meyer, C., Steffen, P. (2004). A discipline of dynamic programming over sequence data. Science of Computer Programming, 51 (3), 215–263. doi: https://doi.org/10.1016/j.scico.2003.12.005
  8. Meyn, S. (2007). Control Techniques for Complex Networks. Cambridge University Press. doi: https://doi.org/10.1017/cbo9780511804410
  9. Boyd, S. P., Vandenberghe, L (2004). Convex Optimization. Cambridge University Press, 727. doi: https://doi.org/10.1017/cbo9780511804441
  10. Sniedovich, M. (2006), Dijkstra's algorithm revisited: the dynamic programming connexion. Journal of Control and Cybernetics, 35 (3), 599–620.
  11. Vasilev, O. M. (2022). Programuvannia movoiu Python. Ternopіl: Navchalna kniga – Bogdan, 504.
  12. Dreyfus, S. (2002). Richard Bellman on the Birth of Dynamic Programming. Operations Research, 50 (1), 48–51. doi: https://doi.org/10.1287/opre.50.1.48.17791
  13. Bellman, R. (2003). Dynamic programming (Dover ed). Mineola: Dover Publications, 384.
  14. Jones, M., Peet, M. M. (2021). A generalization of Bellman’s equation with application to path planning, obstacle avoidance and invariant set estimation. Automatica, 127, 109510. doi: https://doi.org/10.1016/j.automatica.2021.109510
  15. Jones, M., Peet, M. M. (2021). Extensions of the Dynamic Programming Framework: Battery Scheduling, Demand Charges, and Renewable Integration. IEEE Transactions on Automatic Control, 66 (4), 1602–1617. doi: https://doi.org/10.1109/tac.2020.3002235
  16. Dixit, A. K. (1990). Optimization in economic theory. Oxford: Oxford University Press, 164.
  17. Miao, J. (2014). Economic Dynamics in Discrete Time. MIT Press, 134.
  18. Kriazhych, O. O., Itskovych, V. Ye. (2022). Internet rechei v upravlinni skladnymy systemamy. Naukovi pidsumky 2022 roku. Kharkiv: PC TECHNOLOGY CENTER, 19.
  19. Kuprin, O. M. (2022). Algorithmization of processes in recommendation systems. Mathematical Machines and Systems, 1, 71–80. doi: https://doi.org/10.34121/1028-9763-2022-1-71-80
  20. Yushchenko, K. S. (2022). Approach to automating the recruitment process using 3D resumes. Mathematical Machines and Systems, 2, 29–39. doi: https://doi.org/10.34121/1028-9763-2022-2-29-39
  21. Kryazhych, O., Kovalenko, O. (2019). Examining a mathematical apparatus of Z-approximation of functions for the construction of an adaptive algorithm. Eastern-European Journal of Enterprise Technologies, 3 (4 (99)), 6–13. doi: https://doi.org/10.15587/1729-4061.2019.170824
  22. Trofymchuk, O., Adamenko, O., Trysniuk, V. (2021). Heoinformatsiini tekhnolohii zakhystu dovkillia pryrodno-zapovidnoho fondu. Instytut telekomunikatsii ta hlobalnoho informatsiinoho prostoru, Ivano-Frankivskyi natsionalnyi tekhnichnyi universytet nafty ta hazu. Ivano-Frankivsk: Suprun V. P., 343.
Features in solving individual tasks to develop service-oriented networks using dynamic programming

Downloads

Published

2023-02-28

How to Cite

Kryazhych, O., Itskovych, V., Iushchenko, K., & Kuprin, O. (2023). Features in solving individual tasks to develop service-oriented networks using dynamic programming. Eastern-European Journal of Enterprise Technologies, 1(4 (121), 34–40. https://doi.org/10.15587/1729-4061.2023.274144

Issue

Vol. 1 No. 4 (121) (2023): Mathematics and Cybernetics - applied aspects

Section

Mathematics and Cybernetics - applied aspects

License

Copyright (c) 2023 Olha Kryazhych, Victoria Itskovych, Kateryna Iushchenko, Oleksii Kuprin

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.