This paper presents a novel, optimization algorithm called Equilibrium Optimizer (EO), inspired by control volume mass balance models used to estimate both dynamic and equilibrium states. In EO, each particle (solution) with its concentration (position) acts as a search agent. The search agents randomly update their concentration with respect to best-so-far solutions, namely equilibrium candidates, to finally reach to the equilibrium state (optimal result). A well-defined “generation rate” term is proved to invigorate EO’s ability in exploration, exploitation, and local minima avoidance. The proposed algorithm is benchmarked with 58 unimodal, multimodal, and composition functions and three engineering application problems. Results of EO are compared to three categories of existing optimization methods, including: (i) the most well-known meta-heuristics, including Genetic Algorithm (GA), Particle Swarm Optimization (PSO); (ii) recently developed algorithms, including Grey Wolf Optimizer (GWO), Gravitational Search Algorithm (GSA), and Salp Swarm Algorithm (SSA); and (iii) high performance optimizers, including CMA-ES, SHADE, and LSHADE-SPACMA. Using average rank of Friedman test, for all 58 mathematical functions EO is able to outperform PSO, GWO, GA, GSA, SSA, and CMA-ES by 60%, 69%, 94%, 96%, 77%, and 64%, respectively, while it is outperformed by SHADE and LSHADE-SPACMA by 24% and 27%, respectively. The Bonferroni–Dunnand Holm’s tests for all functions showed that EO is significantly a better algorithm than PSO, GWO, GA, GSA, SSA and CMA-ES while its performance is statistically similar to SHADE and LSHADE-SPACMA. The source code of EO is publicly availabe at https://github.com/afshinfaramarzi/Equilibrium-Optimizer , http://built-envi.com/portfolio/equilibrium-optimizer/ and http://www.alimirjalili.com/SourceCodes/EOcode.zip .

Equilibrium optimizer: A novel optimization algorithm

This paper presents a nature-inspired metaheuristic called Marine Predators Algorithm (MPA) and its application in engineering. The main inspiration of MPA is the widespread foraging strategy namely Levy and Brownian movements in ocean predators along with optimal encounter rate policy in biological interaction between predator and prey. MPA follows the rules that naturally govern in optimal foraging strategy and encounters rate policy between predator and prey in marine ecosystems. This paper evaluates the MPA's performance on twenty-nine test functions, test suite of CEC-BC-2017, randomly generated landscape, three engineering benchmarks, and two real-world engineering design problems in the areas of ventilation and building energy performance. MPA is compared with three classes of existing optimization methods, including (1) GA and PSO as the most well-studied metaheuristics, (2) GSA, CS and SSA as almost recently developed algorithms and (3) CMA-ES, SHADE and LSHADE-cnEpSin as high performance optimizers and winners of IEEE CEC competition. Among all methods, MPA gained the second rank and demonstrated very competitive results compared to LSHADE-cnEpSin as the best performing method and one of the winners of CEC 2017 competition. The statistical post hoc analysis revealed that MPA can be nominated as a high-performance optimizer and is a significantly superior algorithm than GA, PSO, GSA, CS, SSA and CMA-ES while its performance is statistically similar to SHADE and LSHADE-cnEpSin. The source code is publicly available at: https://github.com/afshinfaramarzi/Marine-Predators-Algorithm, http://built-envi.com/portfolio/marine-predators-algorithm/, https://www.mathworks.com/matlabcentral/fileexchange/74578-marine-predators-algorithm-mpa, and http://www.alimirjalili.com/MPA.html.

Marine Predators Algorithm: A nature-inspired metaheuristic

EvoCOMNET Contributions.- New Research in Nature Inspired Algorithms for Mobility Management in GSM Networks.- Adaptive Local Search for a New Military Frequency Hopping Planning Problem.- SS vs PBIL to Solve a Real-World Frequency Assignment Problem in GSM Networks.- Reconstruction of Networks from Their Betweenness Centrality.- A Self-learning Optimization Technique for Topology Design of Computer Networks.- A Comparative Study of Fuzzy Inference Systems, Neural Networks and Adaptive Neuro Fuzzy Inference Systems for Portscan Detection.- EvoFIN Contributions.- Evolutionary Single-Position Automated Trading.- Genetic Programming in Statistical Arbitrage.- Evolutionary System for Generating Investment Strategies.- Horizontal Generalization Properties of Fuzzy Rule-Based Trading Models.- Particle Swarm Optimization for Tackling Continuous Review Inventory Models.- Option Model Calibration Using a Bacterial Foraging Optimization Algorithm.- A SOM and GP Tool for Reducing the Dimensionality of a Financial Distress Prediction Problem.- Quantum-Inspired Evolutionary Algorithms for Financial Data Analysis.- EvoHOT Contributions.- Analysis of Reconfigurable Logic Blocks for Evolvable Digital Architectures.- Analogue Circuit Control through Gene Expression.- Discovering Several Robot Behaviors through Speciation.- Architecture Performance Prediction Using Evolutionary Artificial Neural Networks.- Evolving a Vision-Driven Robot Controller for Real-World Indoor Navigation.- Evolving an Automatic Defect Classification Tool.- Deterministic Test Pattern Generator Design.- An Evolutionary Methodology for Test Generation for Peripheral Cores Via Dynamic FSM Extraction.- Exploiting MOEA to Automatically Geneate Test Programs for Path-Delay Faults in Microprocessors.- EvoIASP Contributions.- Evolutionary Object Detection by Means of Naive Bayes Models Estimation.- An Evolutionary Framework for Colorimetric Characterization of Scanners.- Artificial Creatures for Object Tracking and Segmentation.- Automatic Recognition of Hand Gestures with Differential Evolution.- Optimizing Computed Tomographic Angiography Image Segmentation Using Fitness Based Partitioning.- A GA-Based Feature Selection Algorithm for Remote Sensing Images.- An Evolutionary Approach for Ontology Driven Image Interpretation.- Hybrid Genetic Algorithm Based on Gene Fragment Competition for Polyphonic Music Transcription.- Classification of Seafloor Habitats Using Genetic Programming.- Selecting Local Region Descriptors with a Genetic Algorithm for Real-World Place Recognition.- Object Detection Using Neural Networks and Genetic Programming.- Direct 3D Metric Reconstruction from Multiple Views Using Differential Evolution.- Discrete Tomography Reconstruction through a New Memetic Algorithm.- A Fuzzy Hybrid Method for Image Decomposition Problem.- Triangulation Using Differential Evolution.- Fast Multi-template Matching Using a Particle Swarm Optimization Algorithm for PCB Inspection.- EvoMUSART Contributions.- A Generative Representation for the Evolution of Jazz Solos.- Automatic Invention of Fitness Functions with Application to Scene Generation.- Manipulating Artificial Ecosystems.- Evolved Diffusion Limited Aggregation Compositions.- Scaffolding for Interactively Evolving Novel Drum Tracks for Existing Songs.- AtomSwarm: A Framework for Swarm Improvisation.- Using DNA to Generate 3D Organic Art Forms.- Towards Music Fitness Evaluation with the Hierarchical SOM.- Evolutionary Pointillist Modules: Evolving Assemblages of 3D Objects.- An Artificial-Chemistry Approach to Generating Polyphonic Musical Phrases.- Implicit Fitness Functions for Evolving a Drawing Robot.- Free Flight in Parameter Space: A Dynamic Mapping Strategy for Expressive Free Impro.- Modelling Video Games' Landscapes by Means of Genetic Terrain Programming - A New Approach for Improving Users' Experience.- Virtual Constructive Swarm Compositions and Inspirations.- New-Generation Methods in an Interpolating EC Synthesizer Interface.- Composing Music with Neural Networks and Probabilistic Finite-State Machines.- TransFormer #13: Exploration and Adaptation of Evolution Expressed in a Dynamic Sculpture.- EvoNUM Contributions.- Multiobjective Tuning of Robust PID Controllers Using Evolutionary Algorithms.- Truncation Selection and Gaussian EDA: Bounds for Sustainable Progress in High-Dimensional Spaces.- Scalable Continuous Multiobjective Optimization with a Neural Network-Based Estimation of Distribution Algorithm.- Cumulative Step Length Adaptation for Evolution Strategies Using Negative Recombination Weights.- Computing Surrogate Constraints for Multidimensional Knapsack Problems Using Evolution Strategies.- A Critical Assessment of Some Variants of Particle Swarm Optimization.- An Evolutionary Game-Theoretical Approach to Particle Swarm Optimisation.- A Hybrid Particle Swarm Optimization Algorithm for Function Optimization.- EvoSTOC Contributions.- Memory Based on Abstraction for Dynamic Fitness Functions.- A Memory Enhanced Evolutionary Algorithm for Dynamic Scheduling Problems.- Compound Particle Swarm Optimization in Dynamic Environments.- An Evolutionary Algorithm for Adaptive Online Services in Dynamic Environment.- EvoTHEORY Contributions.- A Study of Some Implications of the No Free Lunch Theorem.- Negative Slope Coefficient and the Difficulty of Random 3-SAT Instances.- EvoTRANSLOG Contributions.- A Memetic Algorithm for the Team Orienteering Problem.- Decentralized Evolutionary Optimization Approach to the p-Median Problem.- Genetic Computation of Road Network Design and Pricing Stackelberg Games with Multi-class Users.- Constrained Local Search Method for Bus Fleet Scheduling Problem with Multi-depot with Line Change.- Evolutionary System with Precedence Constraints for Ore Harbor Schedule Optimization.

Applications of evolutionary computing: EvoWorkshops 2008: EvoCOMNET, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008. Proceedings.

Differential Evolution: A review of more than two decades of research

Solving single objective real-parameter optimization problems, also known as a bound-constrained optimization, is still a challenging task. We can find such problems in engineering optimization, scientific applications, and in other real-world problems. Usually, these problems are very complex and computationally expensive. A new algorithm, called jSO, is presented in this paper. The algorithm is an improved variant of the iL-SHADE algorithm, mainly with a new weighted version of mutation strategy. The experiments were performed on CEC 2017 benchmark functions, which are different from previous competition benchmark functions. A comparison of the proposed jSO algorithm and the L-SHADE algorithm is presented first. From the obtained results we can conclude that jSO performs better in comparison with the L-SHADE algorithm. Next, a comparison of jSO and iL-SHADE is also performed, and jSO obtained better or competitive results. Using the CEC 2017 evaluation method, jSO obtained the best final score among these three algorithms.

Single objective real-parameter optimization: Algorithm jSO

This is a Flowchart of MBDE algorithm. A novel "Memory Based DE" algorithm proposed for unconstrained optimization.The algorithm relies on "swarm mutation" and "swarm crossover".Its robustness increased vastly with the help of the "Use of memory" mechanism.It obtains competitive performance with state-of-the-art methods.It has better convergence rate and better efficiency. In optimization, the performance of differential evolution (DE) and their hybrid versions exist in the literature is highly affected by the inappropriate choice of its operators like mutation and crossover. In general practice, during simulation DE does not employ any strategy of memorizing the so-far-best results obtained in the initial part of the previous generation. In this paper, a new "Memory based DE (MBDE)" presented where two "swarm operators" have been introduced. These operators based on the pBEST and gBEST mechanism of particle swarm optimization. The proposed MBDE is employed to solve 12 basic, 25 CEC 2005, and 30 CEC 2014 unconstrained benchmark functions. In order to further test its efficacy, five different test system of model order reduction (MOR) problem for single-input and single-output system are solved by MBDE. The results of MBDE are compared with state-of-the-art algorithms that also solved those problems. Numerical, statistical, and graphical analysis reveals the competency of the proposed MBDE.

A memory based differential evolution algorithm for unconstrained optimization

The Economic Load Dispatch (ELD) problem has attracted much attention in the field of electric power system. This paper proposes a novel parallel hybrid optimization methodology aimed at solving ELD problem with various generator constraints. The proposed approach combines the Differential Evolution (DE) and Particle Swarm Optimization (PSO). Initially the whole population (in increasing order of fitness) is divided into three groups - Inferior Group, Mid Group and Superior Group. DE is employed in the inferior and superior groups, whereas PSO is used in the mid-group. The proposed method is called DPD as it uses DE-PSO-DE on a population in parallel manner. Two strategies namely Elitism (to retain the best obtained values so far) and Non-redundant search (to improve the solution quality) have been employed in DPD cycle. Moreover, the suitable mutation strategy for both DEs used in DPD is investigated over a set of 8 popular mutation strategies. Combination of 8 mutation strategies generated 64 different variants of DPD. Top 4 DPDs are investigated through IEEE CEC 2006 functions. Based on the performance analysis, best DPD is reported and further used in solving four different typical test systems of ELD problem. Numerical and graphical results indicate the efficiency, convergence characteristic and robustness of proposed DPD.

DPD: An intelligent parallel hybrid algorithm for economic load dispatch problems with various practical constraints

A novel hybrid optimizer for solving Economic Load Dispatch problem

A number of efficient variants of differential evolution (DE) and its hybrid have been suggested in recent years to deal with continuous optimization problems. However, recent past studies have indicated that the performance of such algorithms is largely affected by the choice of parameters e.g. mutation factor, crossover rate, mutation strategy and the type of crossover. A combination of these parameters may work out to be the best for a problem while resulting in poor performance for others. In general practice, during simulation DE does not employ any strategy of memorizing the so-far-best results obtained in the initial part of the previous generation. In this paper, a hybrid DE based on use of memory concept under the particle swarm optimization (PSO), called memory based DE (MBDE), is presented for the continuous optimization problems. The algorithm employs two newly operators namely swarm mutation and swarm crossover. These operators are properly balance exploration and exploitation and improving the convergence rate of the proposed algorithm. Experiments are conducted on a comprehensive set of benchmark functions and real life problems. The results of proposed MBDE are compared with state-of-the-art algorithms. Numerical, statistical and graphical analysis reveals the competency of the proposed MBDE.

Raghav Prasad Parouha

Papers

A memory based differential evolution algorithm for unconstrained optimization

DPD: An intelligent parallel hybrid algorithm for economic load dispatch problems with various practical constraints

A novel hybrid optimizer for solving Economic Load Dispatch problem

A robust memory based hybrid differential evolution for continuous optimization problem

An efficient hybrid technique for numerical optimization and applications