Your search
Results 2 resources
-
Modeling of nonlinear industrial systems embraces two key stages: selection of a model structure with a compact parameter list, and selection of an algorithm to estimate the parameter list values. Thus, there is a need to develop a sufficiently adequate model to characterize the behavior of industrial systems to represent experimental data sets. The data collected for many industrial systems may be subject to the existence of high non-linearity and multiple constraints. Meanwhile, creating a thoroughgoing model for an industrial process is essential for model-based control systems. In this work, we explore the use of a proposed Enhanced version of the Cuckoo Search (ECS) algorithm to address a parameter estimation problem for both linear and nonlinear model structures of a real winding process. The performance of the developed models was compared with other mainstream meta-heuristics when they were targeted to model the same process. Moreover, these models were compared with other models developed based on some conventional modeling methods. Several evaluation tests were performed to judge the efficiency of the developed models based on ECS, which showed superior performance in both training and testing cases over that achieved by other modeling methods. © 2022, This is a U.S. government work and not under copyright protection in the U.S.; foreign copyright protection may apply.
-
Crow Search Algorithm (CSA) is a promising meta-heuristic method developed based on the intelligent conduct of crows in nature. This algorithm lacks a good representation of its individuals’ memory, and as with many other meta-heuristics it faces a problem in efficiently balancing exploration and exploitation. These defects may lead to early convergence to local optima. To cope with such issues, we proposed a Memory based Hybrid CSA (MHCSA) with the use of Particle Swarm Optimization (PSO) algorithm. This hybridization approach was proposed to reinforce the diversity ability of CSA and balance its search abilities for promising solutions to achieve robust search performance. The memory element of MHCSA was initialized with the best solution (pbest) of PSO to exploit the most promising search areas. The best positions of the CSA’s individuals are improved using the best solution found so far (gbest) and (pbest) of PSO. Another flaw of CSA is the use of fixed flight length and awareness probability for crows to control exploration and exploitation features, respectively. This issue was circumvented here by replacing these constants with adaptive functions in order to provide a better balance between exploration and exploitation over the course of iterations. The competence of MHCSA was revealed by testing it on seventy-three standard and computationally complex benchmark functions. Its applicability was substantiated by solving seven engineering design problems. The results showed that the problem of early convergence was eliminated by MHCSA and that the balance of exploration and exploitation was further improved. Further, MHCSA ranked first among CSA, PSO, robust variants of CSA and other strong competing methods in terms of accuracy and stability. © 2022, The Author(s), under exclusive licence to Springer Nature B.V.
Explore
Resource type
- Journal Article (2)
Publication year
-
Between 2000 and 2026
(2)
-
Between 2020 and 2026
(2)
- 2022 (2)
-
Between 2020 and 2026
(2)