Velislava Lyubenova
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Velislava Lyubenova has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Olympia Roeva
Department of Bioinformatics and Mathematical Modelling, Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Bl. 105, 1113 Sofia, Bulgaria
11 shared publications - Dafina Zoteva
Faculty of Mathematics and Informatics, Sofia University “St. Kliment Ohridski”, 1164 Sofia, Bulgaria
6 shared publications - Maya Ignatova
Department of Mechatronic Bio/Technological Systems, Institute of Robotics, Bulgarian Academy of Science, Acad. G. Bonchev Str., bl. 2, 1113 Sofia, Bulgaria
5 shared publications - Georgi Kostov
Department of Wine and Beer Technology, University of Food Technologies—Plovdiv, 26 Maritsa Boulevard, 4002 Plovdiv, Bulgaria
4 shared publications - M.N. Ignatova
Institute of Control and System Research, Bulgarian Academy of Sciences, P.O. Box 79, 1113 Sofia, Bulgaria
4 shared publications - Antonio A. Alonso
IIM-CSIC
3 shared publications
Latest Publications
- Open Access
- 17 November 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (22) , 4219
Bound-Based Minimax Design for GDM Pathway Reconstruction Under Inter-Strain Uncertainty: Application to Kluyveromyces marxianus Fermentations
General Dynamical Model (GDM)-based observers estimate unknown bioprocess kinetics, but their reconstruction maps vary across strains. We formulate a minimax design that jointly selects measurement configuration, nominal model and observer tuning using a population-structured uncertainty set and an analytical reconstruction-bound objective. Evaluation uses averaged hourly trajectories from 17 Kluyveromyces marxianus strains and model-derived pathway-rate references. At the prescribed 5% disturbance scenario, the selected substrate-product (SP) design has a bound of 1.4045, 39.5% below biomass-product (XP). Strict training-only leave-one-strain-out validation selects SP in all 17 folds. Eleven folds pass the implemented structural, rate-envelope and kinetic-variation screens, and their exact nodal-box errors remain below the reported asymptotic benchmark and finite-time bounds. These numerical screens do not independently verify continuous-time model adequacy or intersample assumptions. At 5%, SP has the lowest exact error in 15/17 folds under linear interpolation. Empirical reconstruction accuracy depends on the disturbance level and propagation rule; the bound-selected SP design does not consistently outperform the zero-estimator baseline, particularly under causal zero-order hold (ZOH) and at the prescribed 10% disturbance level. The contribution is a bound-based design formulation with conditional analytical guarantees; empirical accuracy depends on the pathway, disturbance scenario and implementation.
- 17 November 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (22) , 4219
Open AccessBound-Based Minimax Design for GDM Pathway Reconstruction Under Inter-Strain Uncertainty: Application to Kluyveromyces marxianus Fermentations
General Dynamical Model (GDM)-based observers estimate unknown bioprocess kinetics, but their reconstruction maps vary across strains. We formulate a minimax design that jointly selects measurement configuration, nominal model and observer tuning using a population-structured uncertainty set and an analytical reconstruction-bound objective. Evaluation uses averaged hourly trajectories from 17 Kluyveromyces marxianus strains and model-derived pathway-rate references. At the prescribed 5% disturbance scenario, the selected substrate-product (SP) design has a bound of 1.4045, 39.5% below biomass-product (XP). Strict training-only leave-one-strain-out validation selects SP in all 17 folds. Eleven folds pass the implemented structural, rate-envelope and kinetic-variation screens, and their exact nodal-box errors remain below the reported asymptotic benchmark and finite-time bounds. These numerical screens do not independently verify continuous-time model adequacy or intersample assumptions. At 5%, SP has the lowest exact error in 15/17 folds under linear interpolation. Empirical reconstruction accuracy depends on the disturbance level and propagation rule; the bound-selected SP design does not consistently outperform the zero-estimator baseline, particularly under causal zero-order hold (ZOH) and at the prescribed 10% disturbance level. The contribution is a bound-based design formulation with conditional analytical guarantees; empirical accuracy depends on the pathway, disturbance scenario and implementation.
- Open Access
- 12 September 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (18) , 3315
A Bounded Adaptive Random Local Mutation Algorithm for Sparse-Data Parameter Identification in Nonlinear Bioprocess Models
Sparse and unevenly informative observations can substantially limit parameter estimation in nonlinear bioprocess models. This proof-of-concept study investigates Bounded Adaptive Random Local Mutation (B-ARLM), a derivative-free algorithm for bounded parameter calibration, using a product-inhibited Andrews-type model of biological hydrogen production calibrated to six interval-average observations over 0–8 days. Andrews–P achieved the lowest in-sample calibration error among the three examined kinetic formulations, with a best-run NMSE of 1.29 × 10−3. Under a common budget of 2250 objective-function evaluations and 30 repeated runs, B-ARLM significantly outperformed the Fixed-EA ablation and the study-specific sCA-ES reference, while its terminal performance was not statistically distinguishable from canonical CMA-ES or jDE after Holm correction. Hyperparameter, broad-start, profile-NMSE, and observation-error sensitivity analyses were additionally performed. Broad-start optimization and two-dimensional profiling revealed widely separated near-optimal parameter vectors and pronounced parameter compensation, showing that accurate trajectory reconstruction does not imply unique kinetic-parameter recovery. The results support B-ARLM as a competitive bounded calibration strategy for the examined sparse-data problem while emphasizing the distinction between optimization performance, practical identifiability, and biological interpretation.
- 12 September 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (18) , 3315
Open AccessA Bounded Adaptive Random Local Mutation Algorithm for Sparse-Data Parameter Identification in Nonlinear Bioprocess Models
Sparse and unevenly informative observations can substantially limit parameter estimation in nonlinear bioprocess models. This proof-of-concept study investigates Bounded Adaptive Random Local Mutation (B-ARLM), a derivative-free algorithm for bounded parameter calibration, using a product-inhibited Andrews-type model of biological hydrogen production calibrated to six interval-average observations over 0–8 days. Andrews–P achieved the lowest in-sample calibration error among the three examined kinetic formulations, with a best-run NMSE of 1.29 × 10−3. Under a common budget of 2250 objective-function evaluations and 30 repeated runs, B-ARLM significantly outperformed the Fixed-EA ablation and the study-specific sCA-ES reference, while its terminal performance was not statistically distinguishable from canonical CMA-ES or jDE after Holm correction. Hyperparameter, broad-start, profile-NMSE, and observation-error sensitivity analyses were additionally performed. Broad-start optimization and two-dimensional profiling revealed widely separated near-optimal parameter vectors and pronounced parameter compensation, showing that accurate trajectory reconstruction does not imply unique kinetic-parameter recovery. The results support B-ARLM as a competitive bounded calibration strategy for the examined sparse-data problem while emphasizing the distinction between optimization performance, practical identifiability, and biological interpretation.
- Open Access
- 2 February 2026
- Published by MDPI AG in Computation
- Vol. 14 (2) , 41
Modelling of Batch Fermentation Processes of Ethanol Production by Kluyveromyces marxianus
A representative cluster-based model of the batch process of ethanol production by Kluyveromyces sp. is proposed. Experimental data from fermentation processes of 17 different strains of K. marxianus are used; each of them potentially exhibits different metabolic and kinetic behavior. Three algorithms for clustering are applied. Two modifications of Principal Component Analysis (PCA)—hierarchical clustering and k-means clustering; and InterCriteria Analysis (ICrA) are used to simplify a large dataset into a smaller set while preserving as much information as possible. The experimental data are organized into two main clusters. As a result, the most representative fermentation processes are identified. For each of the fermentation processes in the clusters, structural and parameter identification are performed. Four different structures describing the specific substrate (glucose) consumption rate are applied. The best structure is used to derive the representative model using the data from the first cluster. Verification of the derived model is performed using experimental data of the second cluster. Model parameter identification is performed by applying an evolutionary optimization algorithm.
- 2 February 2026
- Published by MDPI AG in Computation
- Vol. 14 (2) , 41
Open AccessModelling of Batch Fermentation Processes of Ethanol Production by Kluyveromyces marxianus
A representative cluster-based model of the batch process of ethanol production by Kluyveromyces sp. is proposed. Experimental data from fermentation processes of 17 different strains of K. marxianus are used; each of them potentially exhibits different metabolic and kinetic behavior. Three algorithms for clustering are applied. Two modifications of Principal Component Analysis (PCA)—hierarchical clustering and k-means clustering; and InterCriteria Analysis (ICrA) are used to simplify a large dataset into a smaller set while preserving as much information as possible. The experimental data are organized into two main clusters. As a result, the most representative fermentation processes are identified. For each of the fermentation processes in the clusters, structural and parameter identification are performed. Four different structures describing the specific substrate (glucose) consumption rate are applied. The best structure is used to derive the representative model using the data from the first cluster. Verification of the derived model is performed using experimental data of the second cluster. Model parameter identification is performed by applying an evolutionary optimization algorithm.
- Open Access
A System Designed for Modelling, Monitoring, and Control of Fermentation Processes, Powered by Metaheuristic Algorithms
This paper introduces an Interactive System for Education in Modelling and Control of Biotechnological Processes (InSEMCoBio) for biotechnologists, including students and researchers. The system integrates advanced optimisation algorithms for identifying models of nonlinear systems, along with algorithms for monitoring and controlling biotechnological processes. InSEMCoBio was developed in MATLAB R2017a, featuring a user-friendly graphical interface that bridges complex computational tasks. Three metaheuristics for model identification are built in: an evolutionary algorithm, a genetic algorithm, and a hybrid metaheuristic algorithm. The software allows users to execute integrated algorithms and obtain desired results through visualisation (graphical and tabular) of data, without requiring programming knowledge. The functions of the system are demonstrated through the operation of the algorithms on two biotechnological processes. The ability to compare results of different algorithms is shown. The embedded identification algorithms are applicable beyond biotechnology. This provides the developed system with potential for other interesting applications.
Open AccessA System Designed for Modelling, Monitoring, and Control of Fermentation Processes, Powered by Metaheuristic Algorithms
This paper introduces an Interactive System for Education in Modelling and Control of Biotechnological Processes (InSEMCoBio) for biotechnologists, including students and researchers. The system integrates advanced optimisation algorithms for identifying models of nonlinear systems, along with algorithms for monitoring and controlling biotechnological processes. InSEMCoBio was developed in MATLAB R2017a, featuring a user-friendly graphical interface that bridges complex computational tasks. Three metaheuristics for model identification are built in: an evolutionary algorithm, a genetic algorithm, and a hybrid metaheuristic algorithm. The software allows users to execute integrated algorithms and obtain desired results through visualisation (graphical and tabular) of data, without requiring programming knowledge. The functions of the system are demonstrated through the operation of the algorithms on two biotechnological processes. The ability to compare results of different algorithms is shown. The embedded identification algorithms are applicable beyond biotechnology. This provides the developed system with potential for other interesting applications.
- Open Access
- 2 December 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (23) , 3815
An Effective Hybrid Metaheuristic Approach Based on the Genetic Algorithm
This paper presents an effective hybrid metaheuristic algorithm combining the genetic algorithm (GA) and a simple algorithm based on evolutionary computation. The evolutionary approach (EA) is applied to form the initial population of the GA, thus improving the algorithm’s performance, especially its convergence speed. To assess its effectiveness, the proposed hybrid algorithm, the EAGA, is evaluated on selected benchmark functions, as well as on a real optimisation process. The EAGA is used to identify parameters in a nonlinear system of differential equations modelling an E. coli fed-batch fermentation process. The obtained results are compared against published results from hybrid metaheuristic algorithms applied to the selected optimisation problems. The EAGA hybrid outperforms the competing algorithms due to its effective initial population generation strategy. The risk of premature convergence is reduced. Better numerical outcomes are achieved. The investigations validate the potential of the proposed hybrid metaheuristic EAGA for solving real complex nonlinear optimisation tasks.
- 2 December 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (23) , 3815
Open AccessAn Effective Hybrid Metaheuristic Approach Based on the Genetic Algorithm
This paper presents an effective hybrid metaheuristic algorithm combining the genetic algorithm (GA) and a simple algorithm based on evolutionary computation. The evolutionary approach (EA) is applied to form the initial population of the GA, thus improving the algorithm’s performance, especially its convergence speed. To assess its effectiveness, the proposed hybrid algorithm, the EAGA, is evaluated on selected benchmark functions, as well as on a real optimisation process. The EAGA is used to identify parameters in a nonlinear system of differential equations modelling an E. coli fed-batch fermentation process. The obtained results are compared against published results from hybrid metaheuristic algorithms applied to the selected optimisation problems. The EAGA hybrid outperforms the competing algorithms due to its effective initial population generation strategy. The risk of premature convergence is reduced. Better numerical outcomes are achieved. The investigations validate the potential of the proposed hybrid metaheuristic EAGA for solving real complex nonlinear optimisation tasks.
- Open Access
- 13 July 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (14) , 2205
Model-Based Adaptive Control of Bioreactors—A Brief Review
This article summarizes the authors’ experiences in the development and application of the General Dynamical Model Approach related to adaptive linearizing control of biotechnological processes. Special attention has been given to some original, innovative solutions in model-based process control theory: new formalization of biotechnological process kinetics, derivation and tuning of the general software sensor of the full kinetics of biotechnological processes, and a general algorithm for fully adaptive linearizing control with software sensors. These theoretical solutions are the basis of three control strategies—fully adaptive control of the main substrate, partially adaptive control of intermediate metabolite, and recognition and stabilization of the desired physiological state based on the proposed theoretical solutions. Each strategy is illustrated in different case studies. The advantages and limitations of each of them are identified and discussed. The derived algorithms for monitoring and controlling the considered biotechnological processes are realized and included in a software platform named Interactive System for Education in Modelling and Control of Bioprocesses (InSEMCoBio). The InSEMCoBio modules and their main functions are discussed. The effectiveness of the proposed control strategies (achieving maximum productivity) has been proven through a series of simulation investigations of the considered case studies.
- 13 July 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (14) , 2205
Open AccessModel-Based Adaptive Control of Bioreactors—A Brief Review
This article summarizes the authors’ experiences in the development and application of the General Dynamical Model Approach related to adaptive linearizing control of biotechnological processes. Special attention has been given to some original, innovative solutions in model-based process control theory: new formalization of biotechnological process kinetics, derivation and tuning of the general software sensor of the full kinetics of biotechnological processes, and a general algorithm for fully adaptive linearizing control with software sensors. These theoretical solutions are the basis of three control strategies—fully adaptive control of the main substrate, partially adaptive control of intermediate metabolite, and recognition and stabilization of the desired physiological state based on the proposed theoretical solutions. Each strategy is illustrated in different case studies. The advantages and limitations of each of them are identified and discussed. The derived algorithms for monitoring and controlling the considered biotechnological processes are realized and included in a software platform named Interactive System for Education in Modelling and Control of Bioprocesses (InSEMCoBio). The InSEMCoBio modules and their main functions are discussed. The effectiveness of the proposed control strategies (achieving maximum productivity) has been proven through a series of simulation investigations of the considered case studies.
- Open Access
- 7 March 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (6) , 1292
An Efficient Hybrid of an Ant Lion Optimizer and Genetic Algorithm for a Model Parameter Identification Problem
The immense application of mathematical modeling for the improvement of bioprocesses determines model development as a topical field. Metaheuristic techniques, especially hybrid algorithms, have become a preferred tool in model parameter identification. In this study, two efficient algorithms, the ant lion optimizer (ALO), inspired by the interaction between antlions and ants in a trap, and the genetic algorithm (GA), influenced by evolution and the process of natural selection, have been hybridized for the first time. The novel ALO-GA hybrid aims to balance exploration and exploitation and significantly improve its global optimization ability. Firstly, to verify the effectiveness and superiority of the proposed work, the ALO-GA is compared with several state-of-the-art hybrid algorithms on a set of classical benchmark functions. Further, the efficiency of the ALO-GA is proved in the parameter identification of a model of an Escherichia coli MC4110 fed-batch cultivation process. The obtained results have been studied in contrast to the results of various metaheuristics employed for the same problem. Hybrids between the GA, the artificial bee colony (ABC) algorithm, the ant colony optimization (ACO) algorithm, and the firefly algorithm (FA) are considered. A series of statistical tests, parametric and nonparametric, are performed. Both numerical and statistical results clearly show that ALO-GA outperforms the other competing algorithms. The ALO-GA hybrid algorithm proposed here has achieved an improvement of 6.5% compared to the GA-ACO model, 7% compared to the ACO-FA model, and 7.8% compared to the ABC-GA model.
- 7 March 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (6) , 1292
Open AccessAn Efficient Hybrid of an Ant Lion Optimizer and Genetic Algorithm for a Model Parameter Identification Problem
The immense application of mathematical modeling for the improvement of bioprocesses determines model development as a topical field. Metaheuristic techniques, especially hybrid algorithms, have become a preferred tool in model parameter identification. In this study, two efficient algorithms, the ant lion optimizer (ALO), inspired by the interaction between antlions and ants in a trap, and the genetic algorithm (GA), influenced by evolution and the process of natural selection, have been hybridized for the first time. The novel ALO-GA hybrid aims to balance exploration and exploitation and significantly improve its global optimization ability. Firstly, to verify the effectiveness and superiority of the proposed work, the ALO-GA is compared with several state-of-the-art hybrid algorithms on a set of classical benchmark functions. Further, the efficiency of the ALO-GA is proved in the parameter identification of a model of an Escherichia coli MC4110 fed-batch cultivation process. The obtained results have been studied in contrast to the results of various metaheuristics employed for the same problem. Hybrids between the GA, the artificial bee colony (ABC) algorithm, the ant colony optimization (ACO) algorithm, and the firefly algorithm (FA) are considered. A series of statistical tests, parametric and nonparametric, are performed. Both numerical and statistical results clearly show that ALO-GA outperforms the other competing algorithms. The ALO-GA hybrid algorithm proposed here has achieved an improvement of 6.5% compared to the GA-ACO model, 7% compared to the ACO-FA model, and 7.8% compared to the ABC-GA model.
- 17 September 2022
- Published by Springer Nature
- p. 95-110
Contemporary Bioprocesses Control Algorithms for Educational Purposes
- 17 September 2022
- Published by Springer Nature
- p. 95-110
Contemporary Bioprocesses Control Algorithms for Educational Purposes
- Open Access
- 28 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (15) , 2665
Simultaneous State and Kinetic Observation of Class-Controllable Bioprocesses
Monitoring of bioprocesses is a challenge in designing modern systems for control. In the biotechnology industry, the lack of reliable hardware sensors for key variables related to the metabolism of microorganisms is a topical problem. This predetermines the progress of a scientific field that relies on the development of software sensors for immeasurable variables. In this paper, a new approach for the monitoring of class-controllable bioprocesses that evolve through various physiological states (metabolic regimes) is proposed. At the core of the approach is the potential to present total biomass as a sum of the biomass concentrations obtained during each of the metabolic regimes. Algorithms for estimation of immeasurable variables and their kinetics are here derived and applied using real experimental data. As a case-study, a fed-batch process for phytase production by E. coli is considered. Effectiveness of the method is proven by using two sets of real experiments. One is used to tune the software sensors and the other to verify the approach. The stability analyses are provided, as well. The obtained results and successful verification confirm the adaptive properties of the approach. The considered software sensors will be further built into an interactive system for training specialists/students of biotechnology.
- 28 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (15) , 2665
Open AccessSimultaneous State and Kinetic Observation of Class-Controllable Bioprocesses
Monitoring of bioprocesses is a challenge in designing modern systems for control. In the biotechnology industry, the lack of reliable hardware sensors for key variables related to the metabolism of microorganisms is a topical problem. This predetermines the progress of a scientific field that relies on the development of software sensors for immeasurable variables. In this paper, a new approach for the monitoring of class-controllable bioprocesses that evolve through various physiological states (metabolic regimes) is proposed. At the core of the approach is the potential to present total biomass as a sum of the biomass concentrations obtained during each of the metabolic regimes. Algorithms for estimation of immeasurable variables and their kinetics are here derived and applied using real experimental data. As a case-study, a fed-batch process for phytase production by E. coli is considered. Effectiveness of the method is proven by using two sets of real experiments. One is used to tune the software sensors and the other to verify the approach. The stability analyses are provided, as well. The obtained results and successful verification confirm the adaptive properties of the approach. The considered software sensors will be further built into an interactive system for training specialists/students of biotechnology.
- Open Access
Escherichia coli Cultivation Process Modelling Using ABC-GA Hybrid Algorithm
In this paper, the artificial bee colony (ABC) algorithm is hybridized with the genetic algorithm (GA) for a model parameter identification problem. When dealing with real-world and large-scale problems, it becomes evident that concentrating on a sole metaheuristic algorithm is somewhat restrictive. A skilled combination between metaheuristics or other optimization techniques, a so-called hybrid metaheuristic, can provide more efficient behavior and greater flexibility. Hybrid metaheuristics combine the advantages of one algorithm with the strengths of another. ABC, based on the foraging behavior of honey bees, and GA, based on the mechanics of nature selection, are among the most efficient biologically inspired population-based algorithms. The performance of the proposed ABC-GA hybrid algorithm is examined, including classic benchmark test functions. To demonstrate the effectiveness of ABC-GA for a real-world problem, parameter identification of an Escherichia coli MC4110 fed-batch cultivation process model is considered. The computational results of the designed algorithm are compared to the results of different hybridized biologically inspired techniques (ant colony optimization (ACO) and firefly algorithm (FA))—hybrid algorithms as ACO-GA, GA-ACO and ACO-FA. The algorithms are applied to the same problems—a set of benchmark test functions and the real nonlinear optimization problem. Taking into account the overall searchability and computational efficiency, the results clearly show that the proposed ABC–GA algorithm outperforms the considered hybrid algorithms.
Open AccessEscherichia coli Cultivation Process Modelling Using ABC-GA Hybrid Algorithm
In this paper, the artificial bee colony (ABC) algorithm is hybridized with the genetic algorithm (GA) for a model parameter identification problem. When dealing with real-world and large-scale problems, it becomes evident that concentrating on a sole metaheuristic algorithm is somewhat restrictive. A skilled combination between metaheuristics or other optimization techniques, a so-called hybrid metaheuristic, can provide more efficient behavior and greater flexibility. Hybrid metaheuristics combine the advantages of one algorithm with the strengths of another. ABC, based on the foraging behavior of honey bees, and GA, based on the mechanics of nature selection, are among the most efficient biologically inspired population-based algorithms. The performance of the proposed ABC-GA hybrid algorithm is examined, including classic benchmark test functions. To demonstrate the effectiveness of ABC-GA for a real-world problem, parameter identification of an Escherichia coli MC4110 fed-batch cultivation process model is considered. The computational results of the designed algorithm are compared to the results of different hybridized biologically inspired techniques (ant colony optimization (ACO) and firefly algorithm (FA))—hybrid algorithms as ACO-GA, GA-ACO and ACO-FA. The algorithms are applied to the same problems—a set of benchmark test functions and the real nonlinear optimization problem. Taking into account the overall searchability and computational efficiency, the results clearly show that the proposed ABC–GA algorithm outperforms the considered hybrid algorithms.