Adaptive Multi-Level Search for Global Optimization: An Integrated Swarm Intelligence-Metamodelling Technique

Abstract

Over the last decade, metaheuristic algorithms have emerged as a powerful paradigm for global optimization of multimodal functions formulated by nonlinear problems arising from various engineering subjects. However, numerical analyses of many complex engineering design problems may be performed using finite element method (FEM) or computational fluid dynamics (CFD), by which function evaluations of population-based algorithms are repetitively computed to seek a global optimum. It is noted that these simulations become computationally prohibitive for design optimization of complex structures. To efficiently and effectively address this class of problems, an adaptively integrated swarm intelligence-metamodelling (ASIM) technique enabling multi-level search and model management for the optimal solution is proposed in this paper. The developed technique comprises two steps: in the first step, a global-level exploration for near optimal solution is performed by adaptive swarm-intelligence algorithm, and in the second step, a local-level exploitation for the fine optimal solution is studied on adaptive metamodels, which are constructed by the multipoint approximation method (MAM). To demonstrate the superiority of the proposed technique over other methods, such as conventional MAM, particle swarm optimization, hybrid cuckoo search, and water cycle algorithm in terms of computational expense associated with solving complex optimization problems, one benchmark mathematical example and two real-world complex design problems are examined. In particular, the key factors responsible for the balance between exploration and exploitation are discussed as well.

Non-Destructive Classification of Maize Seeds Based on RGB and Hyperspectral Data with Improved Grey Wolf Optimization Algorithms

“…Swarm intelligence optimization algorithms can effectively address nonlinear parameter optimization problems and possess strong global search capability and adaptability. As a result, they demonstrate excellent performance in practical applications [38][39][40]. According to recent research, swarm intelligence algorithms perform noticeably better than conventional optimization algorithms in a variety of domains, including speech recognition, image processing, path planning, data mining, etc.…”

A Global Optimization Algorithm for Solving Linearly Constrained Quadratic Fractional Problems

“…Gotoh et al [3,7] solved the general quadratic fractional problems by combing Dinkelbach iterative algorithm with the branch and bound algorithm together. Moreover, the metaheuristics-based approaches successfully combining machine learning and swarm intelligence were able to solve the problem globally [8,9]. In recent years, the semidefinite programming (SDP) relaxation and the copositive relaxation have become popular to solve the quadratic fractional programming problems.…”