scholarly journals A novel meta-heuristic optimization algorithm based on cell division: Cell Division Optimizer

2021 ◽  
Author(s):  
Sehej Jain ◽  
Kusum Kumari Bharti
Keyword(s):  
Cell Division ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Cuckoo Search ◽  
Optimization Method ◽  
Global Optimum ◽  
Cellular Level ◽  
Engineering Problem ◽  
Grey Wolf Optimizer ◽  
Division Cell

Abstract A novel meta-heuristic algorithm named as the Cell Division Optimizer (CDO) is proposed. The proposed algorithm is inspired by the reproduction methods at the cellular level, which is formulated by the well-known cell division process known as mitosis and meiosis. In the proposed model Meiosis and Mitosis govern the exploration and exploitation aspects of the optimization algorithm, respectively. In the proposed method, the solutions are updated in two phases to achieve the global optimum solution. The proposed algorithm can be easily adopted to solve the combinatorial optimization method. To evaluate the proposed method, 50 well-known benchmark test functions and also 2 classical engineering optimization problems including 1 mechanical engineering problem and 1 electrical engineering problem are employed. The results of the proposed method are compared with the latest versions of state-of-the-art algorithms like Particle Swarm Optimization, Cuckoo Search, Grey Wolf Optimizer, FruitFly Optimization, Whale Optimizer, Water-Wave Optimizer and recently proposed variants of top-performing algorithms like SHADE (success history-based adaptive differential evolution) and CMAES (Covariance matrix adaptation evolution strategy). Moreover, the convergence speed of the proposed algorithm is better than the considered competitive methods in most cases.

scholarly journals GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1190
Author(s):  
Mohammad Dehghani ◽  
Zeinab Montazeri ◽  
Štěpán Hubálovský
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Random Search ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Main Idea ◽  
Population Based ◽  
Grey Wolf Optimizer ◽  
Whale Optimization

There are many optimization problems in the different disciplines of science that must be solved using the appropriate method. Population-based optimization algorithms are one of the most efficient ways to solve various optimization problems. Population-based optimization algorithms are able to provide appropriate solutions to optimization problems based on a random search of the problem-solving space without the need for gradient and derivative information. In this paper, a new optimization algorithm called the Group Mean-Based Optimizer (GMBO) is presented; it can be applied to solve optimization problems in various fields of science. The main idea in designing the GMBO is to use more effectively the information of different members of the algorithm population based on two selected groups, with the titles of the good group and the bad group. Two new composite members are obtained by averaging each of these groups, which are used to update the population members. The various stages of the GMBO are described and mathematically modeled with the aim of being used to solve optimization problems. The performance of the GMBO in providing a suitable quasi-optimal solution on a set of 23 standard objective functions of different types of unimodal, high-dimensional multimodal, and fixed-dimensional multimodal is evaluated. In addition, the optimization results obtained from the proposed GMBO were compared with eight other widely used optimization algorithms, including the Marine Predators Algorithm (MPA), the Tunicate Swarm Algorithm (TSA), the Whale Optimization Algorithm (WOA), the Grey Wolf Optimizer (GWO), Teaching–Learning-Based Optimization (TLBO), the Gravitational Search Algorithm (GSA), Particle Swarm Optimization (PSO), and the Genetic Algorithm (GA). The optimization results indicated the acceptable performance of the proposed GMBO, and, based on the analysis and comparison of the results, it was determined that the GMBO is superior and much more competitive than the other eight algorithms.

A new meta-heuristic optimization algorithm based on a paradigm from physics: string theory

2021 ◽  
Vol 41 (1) ◽  
pp. 1657-1675
Author(s):  
Luis Rodriguez ◽  
Oscar Castillo ◽  
Mario Garcia ◽  
Jose Soria
Keyword(s):  
String Theory ◽  
Optimization Algorithm ◽  
Fuzzy Inference ◽  
Fuzzy Controller ◽  
Optimization Problems ◽  
Flower Pollination Algorithm ◽  
Grey Wolf Optimizer ◽  
Mathematical Functions ◽  
Inference System ◽  
First Case

The main goal of this paper is to outline a new optimization algorithm based on String Theory, which is a relative new area of physics. The String Theory Algorithm (STA) is a nature-inspired meta-heuristic, which is based on studies about a theory stating that all the elemental particles that exist in the universe are strings, and the vibrations of these strings create all particles existing today. The newly proposed algorithm uses equations based on the laws of physics that are stated in String Theory. The main contribution in this proposed method is the new techniques that are devised in order to generate potential solutions in optimization problems, and we are presenting a detailed explanation and the equations involved in the new algorithm in order to solve optimization problems. In this case, we evaluate this new proposed meta-heuristic with three cases. The first case is of 13 traditional benchmark mathematical functions and a comparison with three different meta-heuristics is presented. The three algorithms are: Flower Pollination Algorithm (FPA), Firefly Algorithm (FA) and Grey Wolf Optimizer (GWO). The second case is the optimization of benchmark functions of the CEC 2015 Competition and we are also presenting a statistical comparison of these results with respect to FA and GWO. In addition, we are presenting a third case, which is the optimization of a fuzzy inference system (FIS), specifically finding the optimal design of a fuzzy controller, where the main goal is to optimize the membership functions of the FIS. It is important to mention that we used these study cases in order to analyze the proposed meta-heuristic with: basic problems, complex problems and control problems. Finally, we present the performance, results and conclusions of the new proposed meta-heuristic.

Stellar Mass Black Hole for Engineering Optimization

2017 ◽  
pp. 62-90
Author(s):  
Premalatha Kandhasamy ◽  
Balamurugan R ◽  
Kannimuthu S
Keyword(s):  
Black Hole ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Cuckoo Search ◽  
Optimization Method ◽  
Stellar Mass ◽  
Bee Colony ◽  
Nature Inspired Algorithms ◽  
The Universe

In recent years, nature-inspired algorithms have been popular due to the fact that many real-world optimization problems are increasingly large, complex and dynamic. By reasons of the size and complexity of the problems, it is necessary to develop an optimization method whose efficiency is measured by finding the near optimal solution within a reasonable amount of time. A black hole is an object that has enough masses in a small enough volume that its gravitational force is strong enough to prevent light or anything else from escaping. Stellar mass Black hole Optimization (SBO) is a novel optimization algorithm inspired from the property of the gravity's relentless pull of black holes which are presented in the Universe. In this paper SBO algorithm is tested on benchmark optimization test functions and compared with the Cuckoo Search, Particle Swarm Optimization and Artificial Bee Colony systems. The experiment results show that the SBO outperforms the existing methods.

scholarly journals A Novel Hybrid Algorithm Based on Grey Wolf Optimizer and Fireworks Algorithm

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 2147 ◽  
Author(s):  
Zhihang Yue ◽  
Sen Zhang ◽  
Wendong Xiao
Keyword(s):  
Hybrid Algorithm ◽  
Optimization Problems ◽  
Optimization Method ◽  
Grey Wolf Optimizer ◽  
Local Optimum ◽  
Grey Wolf ◽  
Optimal Search ◽  
Fireworks Algorithm ◽  
Wide Range ◽  
Search Capability

Grey wolf optimizer (GWO) is a meta-heuristic algorithm inspired by the hierarchy of grey wolves (Canis lupus). Fireworks algorithm (FWA) is a nature-inspired optimization method mimicking the explosion process of fireworks for optimization problems. Both of them have a strong optimal search capability. However, in some cases, GWO converges to the local optimum and FWA converges slowly. In this paper, a new hybrid algorithm (named as FWGWO) is proposed, which fuses the advantages of these two algorithms to achieve global optima effectively. The proposed algorithm combines the exploration ability of the fireworks algorithm with the exploitation ability of the grey wolf optimizer (GWO) by setting a balance coefficient. In order to test the competence of the proposed hybrid FWGWO, 16 well-known benchmark functions having a wide range of dimensions and varied complexities are used in this paper. The results of the proposed FWGWO are compared to nine other algorithms, including the standard FWA, the native GWO, enhanced grey wolf optimizer (EGWO), and augmented grey wolf optimizer (AGWO). The experimental results show that the FWGWO effectively improves the global optimal search capability and convergence speed of the GWO and FWA.

scholarly journals An Adaptive Particle Swarm Optimization Algorithm for Unconstrained Optimization

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-18
Author(s):  
Feng Qian ◽  
Mohammad Reza Mahmoudi ◽  
Hamïd Parvïn ◽  
Kim-Hung Pho ◽  
Bui Anh Tuan
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimization Methods ◽  
Global Optimum ◽  
Initial Population ◽  
Swarm Optimization ◽  
Conventional Optimization

Conventional optimization methods are not efficient enough to solve many of the naturally complicated optimization problems. Thus, inspired by nature, metaheuristic algorithms can be utilized as a new kind of problem solvers in solution to these types of optimization problems. In this paper, an optimization algorithm is proposed which is capable of finding the expected quality of different locations and also tuning its exploration-exploitation dilemma to the location of an individual. A novel particle swarm optimization algorithm is presented which implements the conditioning learning behavior so that the particles are led to perform a natural conditioning behavior on an unconditioned motive. In the problem space, particles are classified into several categories so that if a particle lies within a low diversity category, it would have a tendency to move towards its best personal experience. But, if the particle’s category is with high diversity, it would have the tendency to move towards the global optimum of that category. The idea of the birds’ sensitivity to its flying space is also utilized to increase the particles’ speed in undesired spaces in order to leave those spaces as soon as possible. However, in desirable spaces, the particles’ velocity is reduced to provide a situation in which the particles have more time to explore their environment. In the proposed algorithm, the birds’ instinctive behavior is implemented to construct an initial population randomly or chaotically. Experiments provided to compare the proposed algorithm with the state-of-the-art methods show that our optimization algorithm is one of the most efficient and appropriate ones to solve the static optimization problems.

scholarly journals A New Optimization Algorithm Based on Search and Rescue Operations

2019 ◽  
Vol 2019 ◽  
pp. 1-23 ◽  
Author(s):  
Amir Shabani ◽  
Behrouz Asgarian ◽  
Saeed Asil Gharebaghi ◽  
Miguel A. Salido ◽  
Adriana Giret
Keyword(s):  
Optimization Algorithm ◽  
Real World ◽  
Optimization Problems ◽  
Optimization Algorithms ◽  
Continuous Optimization ◽  
Optimization Method ◽  
Search And Rescue ◽  
Rank Test ◽  
Engineering Design Problems ◽  
Continuous Optimization Problems

In this paper, a new optimization algorithm called the search and rescue optimization algorithm (SAR) is proposed for solving single-objective continuous optimization problems. SAR is inspired by the explorations carried out by humans during search and rescue operations. The performance of SAR was evaluated on fifty-five optimization functions including a set of classic benchmark functions and a set of modern CEC 2013 benchmark functions from the literature. The obtained results were compared with twelve optimization algorithms including well-known optimization algorithms, recent variants of GA, DE, CMA-ES, and PSO, and recent metaheuristic algorithms. The Wilcoxon signed-rank test was used for some of the comparisons, and the convergence behavior of SAR was investigated. The statistical results indicated SAR is highly competitive with the compared algorithms. Also, in order to evaluate the application of SAR on real-world optimization problems, it was applied to three engineering design problems, and the results revealed that SAR is able to find more accurate solutions with fewer function evaluations in comparison with the other existing algorithms. Thus, the proposed algorithm can be considered an efficient optimization method for real-world optimization problems.

Hybrid and Adaptive Metamodel Based Global Optimization

2009 ◽  
Author(s):  
J. Gu ◽  
G. Y. Li ◽  
Z. Dong
Keyword(s):  
Global Optimization ◽  
Design Optimization ◽  
Optimization Problems ◽  
Optimization Method ◽  
Global Optimum ◽  
Superior Performance ◽  
Automatic Identification ◽  
Design Problems ◽  
Sample Data ◽  
Data Points

Metamodeling techniques are increasingly used in solving computation intensive design optimization problems today. In this work, the issue of automatic identification of appropriate metamodeling techniques in global optimization is addressed. A generic, new hybrid metamodel based global optimization method, particularly suitable for design problems involving computation intensive, black-box analyses and simulations, is introduced. The method employs three representative metamodels concurrently in the search process and selects sample data points adaptively according to the values calculated using the three metamodels to improve the accuracy of modeling. The global optimum is identified when the metamodels become reasonably accurate. The new method is tested using various benchmark global optimization problems and applied to a real industrial design optimization problem involving vehicle crash simulation, to demonstrate the superior performance of the new algorithm over existing search methods. Present limitations of the proposed method are also discussed.

scholarly journals Optimization of Complex System Reliability using Hybrid Grey Wolf Optimizer

2021 ◽  
Vol 4 (2) ◽  
pp. 241-256
Author(s):  
Ganga Negi ◽  
◽  
Anuj Kumar ◽  
Sangeeta Pant ◽  
Mangey Ram ◽  
...  
Keyword(s):  
Optimization Problems ◽  
Optimization Technique ◽  
Cuckoo Search ◽  
Optimization Methods ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Reliability Allocation ◽  
Search Optimization ◽  
Cuckoo Search Optimization ◽  
Comparison Of The Results

Reliability allocation to increase the total reliability has become a successful way to increase the efficiency of the complex industrial system designs. A lot of research in the past have tackled this problem to a great extent. This is evident from the different techniques developed so far to achieve the target. Stochastic metaheuristics like simulated annealing, Tabu search (TS), Particle Swarm Optimization (PSO), Cuckoo Search Optimization (CS), Genetic Algorithm (GA), Grey wolf optimization technique (GWO) etc. have been used in recent years. This paper proposes a framework for implementing a hybrid PSO-GWO algorithm for solving some reliability allocation and optimization problems. A comparison of the results obtained is done with the results of other well-known methods like PSO, GWO, etc. The supremacy/competitiveness of the proposed framework is demonstrated from the numerical experiments. These results with regard to the time taken for the computation and quality of solution outperform the previously obtained results by the other well-known optimization methods.

A New Global Optimization Method for Simultaneous Computation on Expensive Black-Box Functions

2003 ◽  
Author(s):  
Liqun Wang ◽  
Songqing Shan ◽  
G. Gary Wang
Keyword(s):  
Global Optimization ◽  
Optimization Problems ◽  
Optimization Methods ◽  
Search Space ◽  
Optimization Method ◽  
Global Optimum ◽  
Black Box ◽  
Efficient Global Optimization ◽  
Global Optimization Method ◽  
Global Optimization Methods

The presence of black-box functions in engineering design, which are usually computation-intensive, demands efficient global optimization methods. This work proposes a new global optimization method for black-box functions. The global optimization method is based on a novel mode-pursuing sampling (MPS) method which systematically generates more sample points in the neighborhood of the function mode while statistically covers the entire search space. Quadratic regression is performed to detect the region containing the global optimum. The sampling and detection process iterates until the global optimum is obtained. Through intensive testing, this method is found to be effective, efficient, robust, and applicable to both continuous and discontinuous functions. It supports simultaneous computation and applies to both unconstrained and constrained optimization problems. Because it does not call any existing global optimization tool, it can be used as a standalone global optimization method for inexpensive problems as well. Limitation of the method is also identified and discussed.

scholarly journals Adaptive Path Following and Locomotion Optimization of Snake-Like Robot Controlled by the Central Pattern Generator

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Zhengcai Cao ◽  
Dong Zhang ◽  
Biao Hu ◽  
Jinguo Liu
Keyword(s):  
Energy Consumption ◽  
Central Pattern Generator ◽  
Optimization Algorithm ◽  
Path Following ◽  
Cuckoo Search ◽  
Optimization Method ◽  
Pattern Generator ◽  
Complex Environment ◽  
Efficiency Optimization ◽  
Control Framework

This work investigates locomotion efficiency optimization and adaptive path following of snake-like robots in a complex environment. To optimize the locomotion efficiency, it takes energy consumption and forward velocity into account to investigate the optimal locomotion parameters of snake-like robots controlled by a central pattern generator (CPG) controller. A cuckoo search (CS) algorithm is applied to optimize locomotion parameters of the robot for environments with variable fractions and obstacle distribution. An adaptive path following method is proposed to steer the snake-like robot forward and along a desired path. The efficiency and accuracy of the proposed path following method is researched. In addition, a control framework that includes a CPG network, a locomotion efficiency optimization algorithm, and an adaptive path following method is designed to control snake-like robots move in different environments. Simulation and experimental results are presented to illustrate the performance of the proposed locomotion optimization method and adaptive path following controller for snake-like robots in complexity terrains.

Sign in / Sign up

Export Citation Format

Share Document