Olexandr Olexandrovich Kuzenkov

Dr. Olexandr Olexandrovich Kuzenkov

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 August 2025 in Computation
Verified
Journal Article
Open access
PDF file
EKElena Kiseleva
Elena Kiseleva
Sergiy YakovlevSergiy Yakovlev
Sergiy Yakovlev
OPOlga Prytomanova
Olga Prytomanova
OKOlexandr Olexandrovich Kuzenkov
Olexandr Olexandrovich Kuzenkov
This study presents an extended approach to compartmental modeling of infectious disease spread, focusing on regional heterogeneity within affected areas. Using classical SIS, SIR, and SEIR frameworks, we simulate the dynamics of COVID-19 across two major regions of Ukraine—Dnipropetrovsk and Kharkiv—during the period 2020–2024. The proposed mathematical model incorporates regionally distributed subpopulations and applies a system of differential equations solved using the classical fourth-order Runge–Kutta method. The simulations are validated against real-world epidemiological data from national and international sources. The SEIR model demonstrated superior performance, achieving maximum relative errors of 4.81% and 5.60% in the Kharkiv and Dnipropetrovsk regions, respectively, outperforming the SIS and SIR models. Despite limited mobility and social contact data, the regionally adapted models achieved acceptable accuracy for medium-term forecasting. This validates the practical applicability of extended compartmental models in public health planning, particularly in settings with constrained data availability. The results further support the use of these models for estimating critical epidemiological indicators such as infection peaks and hospital resource demands. The proposed framework offers a scalable and computationally efficient tool for regional epidemic forecasting, with potential applications to future outbreaks in geographically heterogeneous environments.

11 September 2024 in Computation
Verified
Journal Article
Open access
PDF file
EKElena Kiseleva
Elena Kiseleva
Sergiy YakovlevSergiy Yakovlev
Sergiy Yakovlev
Dmytro ChumachenkoDmytro Chumachenko
Dmytro Chumachenko
OKOlexandr Olexandrovich Kuzenkov
Olexandr Olexandrovich Kuzenkov
This study proposes and theoretically substantiates a unique mathematical model for predicting the spread of infectious diseases using the example of COVID-19. The model is described by a special system of autonomous differential equations, which has scientific novelty for cases of complex dynamics of disease transmission. The adequacy of the model is confirmed by testing on the example of the spread of COVID-19 in one of the largest regions of Ukraine, both in terms of population and area. The practical novelty emerges through its versatile application in real-world contexts, guiding organizational decisions and public health responses. The model’s capacity to facilitate system functioning evaluation and identify significant parameters underlines its potential for proactive management and effective response in the evolving landscape of infectious diseases.

1 September 2013
Verified
Conference Paper
Closed access
SCSerge V. Chernyshenko
Serge V. Chernyshenko
OKOlexandr Olexandrovich Kuzenkov
Olexandr Olexandrovich Kuzenkov
The contribution is devoted to qualitative investigation of subpopulation dynamics, described by a degenerate differential model with basic logistic function. The research includes: finding stationary sets, such as isolated special points and stationary hyper-planes, investigation of their stability, complete classification of system phase portraits, complete classification of bifurcations in the system, determination of emergence condition. The main results of the qualitative analysis of the proposed model are represented in the form of theorems. Research results are illustrated with several graphs: system phase portraits and bifurcation diagrams. The illustrations demonstrate adequacy of qualitative results, obtained from the model simulation.

29 November 2022
Verified
Book Chapter
Closed access
PDF file
VSVasyl Stopkin
Vasyl Stopkin
ANAnatoliy Nikolenko
Anatoliy Nikolenko
VKVitalii Kuznetsov
Vitalii Kuznetsov
MTMykola Tryputen
Mykola Tryputen
OKOlexandr Olexandrovich Kuzenkov
Olexandr Olexandrovich Kuzenkov

26 September 2025 in Science and Transport Progress
Verified
Journal Article
Open access
PDF file
EKElena Kiseleva
Elena Kiseleva
OPOlga Prytomanova
Olga Prytomanova
OKOlexandr Olexandrovich Kuzenkov
Olexandr Olexandrovich Kuzenkov
Purpose. Among various formulations of the optimal set partitioning (OSP) problem, dynamic variants—where optimization conditions change over time—are of particular interest due to their relevance for real-world applications. Such systems often operate under uncertainty, which may arise from imprecise or incomplete input data, vague parameters, or unreliable mathematical representations of system behavior. This study develops a comprehensive mathematical and computational framework for solving dynamic OSP problems under uncertainty. The aim of the study is to develop software for solving a novel dynamic optimal set partitioning problem under uncertainty, specifically including the formulation of a numerical experiment, the applied interpretation of the obtained results, and a comparative analysis of the numerical experiment outcomes with the analytical results of the model investigation. Methodology. The methodological basis of the study consists of the principles of optimal set partitioning theory and fuzzy set theory. Modern numerical methods were used to solve systems of ordinary differential equations necessary for determining the parameters of the dynamic model. Findings. The formulation of dynamic optimal set partitioning problems under uncertainty allows including fuzzy model parameters and obtaining results even with incomplete information about the system. The work presents a clearly defined algorithm for solving the problem, determined by its mathematical formulation. Originality. The proposed models represent a significant contribution to the development of mathematical modeling, particularly in dynamic and fuzzy problem formulations. Methods and algorithms for solving the formalized problems are presented, and the results of comparative analysis allow assessing the analytical and numerical advantages of both models and the dynamic approach to solving such problems. Practical value. The practical value of the results obtained in this study lies in the formulation of a novel dynamic optimal set partitioning problem under uncertainty, the development of software for the numerical implementation of the experiment, and the visualization of the obtained results. The formalized mathematical model and the developed software can be applied to a wide range of practical problems, such as logistics, facility location, partitioning of communities into administrative service centers, and others.

30 June 2025 in Modern problems of modeling
Verified
Journal Article
Open access
PDF file
Sergiy YakovlevSergiy Yakovlev
Sergiy Yakovlev
EKElena Kiseleva
Elena Kiseleva
OUOles Honchar Dnipro National University
Oles Honchar Dnipro National University
LHL Hart
L Hart
OKOlexandr Olexandrovich Kuzenkov
Olexandr Olexandrovich Kuzenkov
ДЗД.в. Закутній
Д.в. Закутній
У статті сформульовано та досліджено динамічну задачу оптимального розбиття множини (ОРМ) з фіксованими центрами, яка належить до класу задач просторового розподілу з динамічно змінюваними параметрами. Наведено формалізовану постановку задачі, алгоритм її розв’язання та результати чисельного експерименту, що підтверджують ефективність і точність запропонованого підходу. Актуальність обраної теми зумовлена широкою застосовністю задач оптимального розбиття у динамічному формулюванні для розв’язання прикладних задач у логістиці, управлінні ресурсами, плануванні обслуговування територій та інших галузях, де витрати мають часову залежність. На відміну від статичних модельних задач, у реальних умовах вартість транспортування між елементами може змінюватися у часі, що суттєво впливає як на пошук оптимального розв’язку, так і на значення цільового функціоналу. У роботі розглянуто декілька моделей вартості транспортування, включаючи лінійну, експоненційну та випадкову (стохастичну), що дозволяє покращити адаптацію моделей до конкретних прикладних ситуацій. Для реалізації чисельного експерименту було розроблено спеціалізоване програмне забезпечення на мові Python, яке інтегрує сучасні чисельні методи, зокрема метод покрокової оптимізації, модифіковані градієнтні підходи, а також засоби графічного аналізу результатів. Модель ґрунтується на класичній постановці задачі оптимального розбиття з фіксованими центрами, проте вводить часову залежність у вартісні коефіцієнти, що дозволяє моделювати складні сценарії розподілу з урахуванням фактору часу. Проведено порівняльний аналіз результатів моделювання як у динамічному, так і в статичному підходах, що дозволило виявити переваги динамічного формулювання: вищу точність, більшу гнучкість та адаптивність при зміні умов задачі. Обчислення здійснювались на персональному комп’ютері з конфігурацією: Intel Core i7-12700K, 8 ядер, частота 3,6 ГГц; оперативна пам’ять 32 ГБ DDR4; накопичувач – SSD 2 ТБ. Отримані результати підтвердили не лише ефективність математичної моделі, а й правильність реалізації алгоритмів, що додатково проілюстровано графічними побудовами фазових траєкторій та візуалізацією отриманих розбиттів. Ключові слова: динамічна задача, оптимальне розбиття множини, цільовий функціонал, фазова траєкторія, чисельні методи, часові залежності, Python. The article formulates and investigates a dynamic optimal set partitioning (OSP) problem with fixed centers, which belongs to the class of spatial distribution problems with dynamically changing parameters. A formal problem statement, solution algorithm, and results of a numerical experiment confirming the efficiency and accuracy of the proposed approach are presented. The relevance of the selected topic is driven by the wide applicability of optimal partitioning problems in dynamic formulations for solving applied tasks in logistics, resource management, service area planning, and other domains where cost depends on time. Unlike static model problems, in real-world conditions, the transportation cost between elements may vary over time, significantly affecting both the search for the optimal solution and the value of the objective functional. The study considers several transportation cost models, including linear, exponential, and random (stochastic), enabling improved adaptation of models to specific applied contexts. To conduct the numerical experiment, specialized software was developed in Python, integrating modern numerical methods such as step-by-step optimization, modified gradient approaches, and graphical result analysis tools. The model is based on the classical formulation of the optimal partitioning problem with fixed centers but introduces temporal dependencies into cost coefficients, allowing the simulation of complex distribution scenarios with time as a factor. A comparative analysis of modeling results for both dynamic and static approaches was carried out, demonstrating the advantages of the dynamic formulation: higher accuracy, greater flexibility, and...