scispace - formally typeset
Journal ArticleDOI

Auto-tuning strategy for evolutionary algorithms: balancing between exploration and exploitation

Lin Lin, +1 more
- Vol. 13, Iss: 2, pp 157-168
Reads0
Chats0
TLDR
An auto-tuning strategy by using fuzzy logic control for taking the balance among the stochastic search and local search probabilities based on the change of the average fitness of parents and offspring which is occurred at each generation is proposed.
Abstract
Genetic Algorithms (GAs) and other Evolutionary Algorithms (EAs), as powerful and broadly applicable stochastic search and optimization techniques have been successfully applied in the area of management science, operations research and industrial engineering. In the past few years, researchers gave lots of great idea for improvement of evolutionary algorithms, which include population initialization, individual selection, evolution, parameter setting, hybrid approach with conventional heuristics etc. However, though lots of different versions of evolutionary computations have been created, all of them have turned most of its attention to the development of search abilities of approaches. In this paper, for improving the search ability, we focus on how to take a balance between exploration and exploitation of the search space. It is also very difficult to solve problem, because the balance between exploration and exploitation is depending on the characteristic of different problems. The balance also should be changed dynamically depend on the status of evolution process. Purpose of this paper is the design of an effective approach which it can correspond to most optimization problems. In this paper, we propose an auto-tuning strategy by using fuzzy logic control. The main idea is adaptively regulation for taking the balance among the stochastic search and local search probabilities based on the change of the average fitness of parents and offspring which is occurred at each generation. In addition, numerical analyses of different type optimization problems show that the proposed approach has higher search capability that improve quality of solution and enhanced rate of convergence.

read more

Citations
More filters
Journal ArticleDOI

Grey Wolf Optimizer

TL;DR: The results of the classical engineering design problems and real application prove that the proposed GWO algorithm is applicable to challenging problems with unknown search spaces.
Journal ArticleDOI

The Whale Optimization Algorithm

TL;DR: Optimization results prove that the WOA algorithm is very competitive compared to the state-of-art meta-heuristic algorithms as well as conventional methods.
Journal ArticleDOI

Slime mould algorithm: A new method for stochastic optimization

TL;DR: The proposed slime mould algorithm has several new features with a unique mathematical model that uses adaptive weights to simulate the process of producing positive and negative feedback of the propagation wave of slime mould based on bio-oscillator to form the optimal path for connecting food with excellent exploratory ability and exploitation propensity.
Journal ArticleDOI

Henry gas solubility optimization: A novel physics-based algorithm

TL;DR: A novel metaheuristic algorithm named Henry gas solubility optimization (HGSO), which mimics the behavior governed by Henry’s law to solve challenging optimization problems, provides competitive and superior results compared to other algorithms when solving challenging optimize problems.
Journal ArticleDOI

Black Widow Optimization Algorithm: A novel meta-heuristic approach for solving engineering optimization problems

TL;DR: The results indicate that the proposed BWO algorithm has numerous advantages in different aspects such as early convergence and achieving optimized fitness value compared to other algorithms, and has the capability of providing competitive and promising results.
References
More filters
Book

Genetic algorithms in search, optimization, and machine learning

TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Book

Adaptation in natural and artificial systems

TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Book

Genetic Algorithms + Data Structures = Evolution Programs

TL;DR: GAs and Evolution Programs for Various Discrete Problems, a Hierarchy of Evolution Programs and Heuristics, and Conclusions.
Journal ArticleDOI

Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach

TL;DR: The proof-of-principle results obtained on two artificial problems as well as a larger problem, the synthesis of a digital hardware-software multiprocessor system, suggest that SPEA can be very effective in sampling from along the entire Pareto-optimal front and distributing the generated solutions over the tradeoff surface.
Book

Ant Colony Optimization

TL;DR: Ant colony optimization (ACO) is a relatively new approach to problem solving that takes inspiration from the social behaviors of insects and of other animals as discussed by the authors In particular, ants have inspired a number of methods and techniques among which the most studied and the most successful is the general purpose optimization technique known as ant colony optimization.
Related Papers (5)