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

2021 ◽  
Vol 11 (5) ◽  
pp. 2277
Author(s):  
Guirong Dong ◽  
Chengyang Liu ◽  
Dianzi Liu ◽  
Xiaoan Mao

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.

2015 ◽  
Vol 764-765 ◽  
pp. 305-308
Author(s):  
Kuang Hung Hsien ◽  
Shyh Chour Huang

In this paper, hybrid weights-utility and Taguchi method is proposed to solve multi-objective optimization problems. The new method combines the Taguchi method and the weights-utility concept. The weights of the objective function and overall utility values are very important for the weights-utility, and must be set correctly in order to obtain an optimal solution. Application of this method to engineering design problems is illustrated with the aid of one case study, and the result shows that the weights-utlity method is able to handle multi-objective optimization problems, with an optimal solution which better meets the demand of multi-objective optimization problems than the utility concept does.


2021 ◽  
Vol 18 (6) ◽  
pp. 7076-7109
Author(s):  
Shuang Wang ◽  
◽  
Heming Jia ◽  
Qingxin Liu ◽  
Rong Zheng ◽  
...  

<abstract> <p>This paper introduces an improved hybrid Aquila Optimizer (AO) and Harris Hawks Optimization (HHO) algorithm, namely IHAOHHO, to enhance the searching performance for global optimization problems. In the IHAOHHO, valuable exploration and exploitation capabilities of AO and HHO are retained firstly, and then representative-based hunting (RH) and opposition-based learning (OBL) strategies are added in the exploration and exploitation phases to effectively improve the diversity of search space and local optima avoidance capability of the algorithm, respectively. To verify the optimization performance and the practicability, the proposed algorithm is comprehensively analyzed on standard and CEC2017 benchmark functions and three engineering design problems. The experimental results show that the proposed IHAOHHO has more superior global search performance and faster convergence speed compared to the basic AO and HHO and selected state-of-the-art meta-heuristic algorithms.</p> </abstract>


2020 ◽  
Vol 8 (6) ◽  
pp. 4843-4855

The algorithms that have been developed recently have decorous behavior to solve and find optimum solution to various optimization problems in search space. Withal such calculations stuck in issues nearby quest space for compelled engineering problems. In succession to achieve an optimal solution a hybrid algorithmic approach is proffered. Artificial Neural Network (ANN) is considered as better solution for the known outputs. A hybrid variant of applying ANN on Harris Hawks and Whale Optimization Algorithm (ANNHHOWOA) is proposed to achieve effective solution for engineering problems. The effectiveness of proposed algorithm is tested for various nonlinear, non-convex and standard engineering problems and to approve consequences of proposed algorithm standard benchmarks and multidisciplinary design problems have been considered. The validation endorsed that the results shown by ANNHHOWOA showed much better results than individual ANN, HHO and WOA and its effectiveness on multidisciplinary engineering problems.


Energies ◽  
2021 ◽  
Vol 14 (15) ◽  
pp. 4613
Author(s):  
Shah Fahad ◽  
Shiyou Yang ◽  
Rehan Ali Khan ◽  
Shafiullah Khan ◽  
Shoaib Ahmed Khan

Electromagnetic design problems are generally formulated as nonlinear programming problems with multimodal objective functions and continuous variables. These can be solved by either a deterministic or a stochastic optimization algorithm. Recently, many intelligent optimization algorithms, such as particle swarm optimization (PSO), genetic algorithm (GA) and artificial bee colony (ABC), have been proposed and applied to electromagnetic design problems with promising results. However, there is no universal algorithm which can be used to solve engineering design problems. In this paper, a stochastic smart quantum particle swarm optimization (SQPSO) algorithm is introduced. In the proposed SQPSO, to tackle the premature convergence problem in order to improve the global search ability, a smart particle and a memory archive are adopted instead of mutation operations. Moreover, to enhance the exploration searching ability, a new set of random numbers and control parameters are introduced. Experimental results validate that the adopted control policy in this work can achieve a good balance between exploration and exploitation. Finally, the SQPSO has been tested on well-known optimization benchmark functions and implemented on the electromagnetic TEAM workshop problem 22. The simulation result shows an outstanding capability of the proposed algorithm in speeding convergence compared to other algorithms.


2022 ◽  
Vol 19 (1) ◽  
pp. 473-512
Author(s):  
Rong Zheng ◽  
◽  
Heming Jia ◽  
Laith Abualigah ◽  
Qingxin Liu ◽  
...  

<abstract> <p>Arithmetic optimization algorithm (AOA) is a newly proposed meta-heuristic method which is inspired by the arithmetic operators in mathematics. However, the AOA has the weaknesses of insufficient exploration capability and is likely to fall into local optima. To improve the searching quality of original AOA, this paper presents an improved AOA (IAOA) integrated with proposed forced switching mechanism (FSM). The enhanced algorithm uses the random math optimizer probability (<italic>RMOP</italic>) to increase the population diversity for better global search. And then the forced switching mechanism is introduced into the AOA to help the search agents jump out of the local optima. When the search agents cannot find better positions within a certain number of iterations, the proposed FSM will make them conduct the exploratory behavior. Thus the cases of being trapped into local optima can be avoided effectively. The proposed IAOA is extensively tested by twenty-three classical benchmark functions and ten CEC2020 test functions and compared with the AOA and other well-known optimization algorithms. The experimental results show that the proposed algorithm is superior to other comparative algorithms on most of the test functions. Furthermore, the test results of two training problems of multi-layer perceptron (MLP) and three classical engineering design problems also indicate that the proposed IAOA is highly effective when dealing with real-world problems.</p> </abstract>


Author(s):  
Shufen Qin ◽  
Chan Li ◽  
Chaoli Sun ◽  
Guochen Zhang ◽  
Xiaobo Li

AbstractSurrogate-assisted evolutionary algorithms have been paid more and more attention to solve computationally expensive problems. However, model management still plays a significant importance in searching for the optimal solution. In this paper, a new method is proposed to measure the approximation uncertainty, in which the differences between the solution and its neighbour samples in the decision space, and the ruggedness of the objective space in its neighborhood are both considered. The proposed approximation uncertainty will be utilized in the surrogate-assisted global search to find a solution for exact objective evaluation to improve the exploration capability of the global search. On the other hand, the approximated fitness value is adopted as the infill criterion for the surrogate-assisted local search, which is utilized to improve the exploitation capability to find a solution close to the real optimal solution as much as possible. The surrogate-assisted global and local searches are conducted in sequence at each generation to balance the exploration and exploitation capabilities of the method. The performance of the proposed method is evaluated on seven benchmark problems with 10, 20, 30 and 50 dimensions, and one real-world application with 30 and 50 dimensions. The experimental results show that the proposed method is efficient for solving the low- and medium-dimensional expensive optimization problems by compared to the other six state-of-the-art surrogate-assisted evolutionary algorithms.


Author(s):  
Ahmed T. Sadiq Al-Obaidi ◽  
Hasanen S. Abdullah ◽  
Zied O. Ahmed

<p>Evolutionary computation and swarm intelligence meta-heuristics are exceptional instances that environment has been a never-ending source of creativeness. The behavior of bees, bacteria, glow-worms, fireflies and other beings have stirred swarm intelligence scholars to create innovative optimization algorithms. This paper proposes the Meerkat Clan Algorithm (MCA) that is a novel swarm intelligence algorithm resulting from watchful observation of the Meerkat (Suricata suricatta) in the Kalahari Desert in southern Africa. This animal shows an exceptional intelligence, tactical organizational skills, and remarkable directional cleverness in its traversal of the desert when searching for food. A Meerkat Clan Algorithm (MCA) proposed to solve the optimization problems through reach the optimal solution by efficient way comparing with another swarm intelligence. Traveling Salesman Problem uses as a case study to measure the capacity of the proposed algorithm through comparing its results with another swarm intelligence. MCA shows its capacity to solve the Traveling Salesman’s Problem. Its dived the solutions group to sub-group depend of meerkat behavior that gives a good diversity to reach an optimal solution. Paralleled with the current algorithms for resolving TSP by swarm intelligence, it has been displayed that the size of the resolved problems could be enlarged by adopting the algorithm proposed here.</p>


Author(s):  
LianShui Guo ◽  
Xuan Zhou ◽  
Lian Zhao ◽  
Qingming Liu

Product conceptual design derives from the functional requirement initially, and the overall structure control for product design is one of the most difficult problems being addressed in CAD modeling. The objective of this investigation is to present a framework on rapid modeling using rules and mechanism library for mapping between functions and mechanism structures. In this paper, it is shown that the overall structure can be achieved largely by using multi-level parametric skeleton model. In order to drive the conceptual design into a more detailed design, the intelligent master model is presented to realize the parametric feature modeling and design knowledge reuse. The main contribution of this paper is that an integrated framework has been developed to design assembling tools of satellite by using a necessary auxiliary wizard. The case studies presented demonstrate the potential significance of this work for a wide range of engineering design problems.


Author(s):  
Janga Reddy Manne

Most of the engineering design problems are intrinsically complex and difficult to solve, because of diverse solution search space, complex functions, continuous and discrete nature of decision variables, multiple objectives and hard constraints. Swarm intelligence (SI) algorithms are becoming popular in dealing with these kind of complexities. The SI algorithms being population based random search techniques, use heuristics inspired from nature to enable effective exploration of optimal solutions to complex engineering problems. The SI algorithms derived based on principles of co-operative group intelligence and collective behavior of self-organized systems. This chapter presents key principles of multi-optimization, and swarm optimization for solving multi-objective engineering design problems with illustration through few examples.


Mathematics ◽  
2019 ◽  
Vol 7 (3) ◽  
pp. 250 ◽  
Author(s):  
Umesh Balande ◽  
Deepti Shrimankar

Firefly-Algorithm (FA) is an eminent nature-inspired swarm-based technique for solving numerous real world global optimization problems. This paper presents an overview of the constraint handling techniques. It also includes a hybrid algorithm, namely the Stochastic Ranking with Improved Firefly Algorithm (SRIFA) for solving constrained real-world engineering optimization problems. The stochastic ranking approach is broadly used to maintain balance between penalty and fitness functions. FA is extensively used due to its faster convergence than other metaheuristic algorithms. The basic FA is modified by incorporating opposite-based learning and random-scale factor to improve the diversity and performance. Furthermore, SRIFA uses feasibility based rules to maintain balance between penalty and objective functions. SRIFA is experimented to optimize 24 CEC 2006 standard functions and five well-known engineering constrained-optimization design problems from the literature to evaluate and analyze the effectiveness of SRIFA. It can be seen that the overall computational results of SRIFA are better than those of the basic FA. Statistical outcomes of the SRIFA are significantly superior compared to the other evolutionary algorithms and engineering design problems in its performance, quality and efficiency.


Sign in / Sign up

Export Citation Format

Share Document