Browsing by Author "Senkerik, Roman"

Now showing 1 - 2 of 2

Access status: Open Access ,
Efficient time-delay system optimization with auto-configured metaheuristics
(2024) Senkerik, Roman; Guzowski, Hubert; Janku, Peter; Kadavy, Tomas; Kominkova Oplatkova, Zuzana; Matusu, Radek; Pluhacek, Michal; Pekar, Libor; Viktorin, Adam; Byrski, Aleksander; Smołka, Maciej
Wydział Informatyki
This paper presents an experimental study that compares the performance of four selected metaheuristic algorithms for optimizing a time delay system model. Time delay system models are complex and challenging to optimize due to their inherent characteristics, such as non-linearity, multi-modality, and constraints. The study includes an explanation of the choice and core functionality of the selected algorithms, which are both baseline and state-of-the-art variants of self-organizing migrating algorithm (SOMA), state-of-the-art variant from the Success-History-based Adaptive Differential Evolution family of algorithms, with emphasis on diverse search (DISH algorithm), and Covariance Matrix Adaptation Evolution Strategy (CMA-ES) algorithm. The hyperparameters of the metaheuristic algorithms were set using the iRace automatic algorithm configuration framework. The paper emphasizes the importance of metaheuristic algorithms in control engineering for time-delay systems to develop more effective and efficient control strategies and precise model identifications. The experimental results highlight the effectiveness of the state-of-the-art algorithms with specific adaptive mechanisms like population organization process, diverse search and adaptation mechanisms ensuring a gradual transition from exploration to exploitation. Overall, this study contributes to understanding the challenges and advantages of using metaheuristic algorithms in control engineering for time delay systems. The results provide valuable insights into the performance of modern metaheuristic algorithms and can help guide the selection of appropriate adaptive mechanisms of metaheuristics.
Access status: Open Access ,
Maximizing efficiency: a comparative study of SOMA variants and constraint handling methods for time delay system optimization
(2023) Senkerik, Roman; Kadavy, Tomas; Janku, Peter; Pluhacek, Michal; Guzowski, Hubert; Pekar, Libor; Matusu, Radek; Viktorin, Adam; Smołka, Maciej; Byrski, Aleksander; Komínková Oplatková, Zuzana
Wydział Informatyki
This paper presents an experimental study that compares four adaptive variants of the self-organizing migrating algorithm (SOMA). Each variant uses three different constraint handling methods for the optimization of a time delay system model. The paper emphasizes the importance of metaheuristic algorithms in control engineering for time-delayed systems to develop more effective and efficient control strategies and precise model identifications. The study includes a detailed description of the selected variants of the SOMA and the adaptive mechanisms used. A complex workflow of experiments is described, and the results and discussion are presented. The experimental results highlight the effectiveness of the SOMA variants with specific constraint handling methods for time delay system optimization. Overall, this study contributes to the understanding of the challenges and advantages of using metaheuristic algorithms in control engineering for time delay systems. The results provide valuable insights into the performance of the SOMA variants and can help guide the selection of appropriate constraint handling methods and the adaptive mechanisms of metaheuristics.