scholarly journals A Novel Hybrid Self-Adaptive Bat Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Iztok Fister ◽  
Simon Fong ◽  
Janez Brest ◽  
Iztok Fister
Keyword(s):  
Optimization Problems ◽  
Bat Algorithm ◽  
Search Space ◽  
Combinatorial Problems ◽  
Control Parameters ◽  
Search Heuristics ◽  
Self Adaptation ◽  
Nature Inspired Algorithms ◽  
Extensive Family ◽  
Self Adaptive

Nature-inspired algorithms attract many researchers worldwide for solving the hardest optimization problems. One of the newest members of this extensive family is the bat algorithm. To date, many variants of this algorithm have emerged for solving continuous as well as combinatorial problems. One of the more promising variants, a self-adaptive bat algorithm, has recently been proposed that enables a self-adaptation of its control parameters. In this paper, we have hybridized this algorithm using different DE strategies and applied these as a local search heuristics for improving the current best solution directing the swarm of a solution towards the better regions within a search space. The results of exhaustive experiments were promising and have encouraged us to invest more efforts into developing in this direction.

scholarly journals Binary Spring Search Algorithm for Solving Various Optimization Problems

2021 ◽  
Vol 11 (3) ◽  
pp. 1286 ◽  
Author(s):  
Mohammad Dehghani ◽  
Zeinab Montazeri ◽  
Ali Dehghani ◽  
Om P. Malik ◽  
Ruben Morales-Menendez ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
High Performance ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Bat Algorithm ◽  
Search Space ◽  
Binary Particle Swarm Optimization ◽  
Dragonfly Algorithm ◽  
Grasshopper Optimization Algorithm

One of the most powerful tools for solving optimization problems is optimization algorithms (inspired by nature) based on populations. These algorithms provide a solution to a problem by randomly searching in the search space. The design’s central idea is derived from various natural phenomena, the behavior and living conditions of living organisms, laws of physics, etc. A new population-based optimization algorithm called the Binary Spring Search Algorithm (BSSA) is introduced to solve optimization problems. BSSA is an algorithm based on a simulation of the famous Hooke’s law (physics) for the traditional weights and springs system. In this proposal, the population comprises weights that are connected by unique springs. The mathematical modeling of the proposed algorithm is presented to be used to achieve solutions to optimization problems. The results were thoroughly validated in different unimodal and multimodal functions; additionally, the BSSA was compared with high-performance algorithms: binary grasshopper optimization algorithm, binary dragonfly algorithm, binary bat algorithm, binary gravitational search algorithm, binary particle swarm optimization, and binary genetic algorithm. The results show the superiority of the BSSA. The results of the Friedman test corroborate that the BSSA is more competitive.

scholarly journals A-DVM: A Self-Adaptive Variable Matrix Decision Variable Selection Scheme for Multimodal Problems

Entropy ◽  
2020 ◽  
Vol 22 (9) ◽  
pp. 1004
Author(s):  
Marco Antonio Florenzano Mollinetti ◽  
Bernardo Bentes Gatto ◽  
Mário Tasso Ribeiro Serra Neto ◽  
Takahito Kuno
Keyword(s):  
Variable Selection ◽  
Optimization Problems ◽  
Search Space ◽  
Population Based ◽  
Decision Variable ◽  
Numerical Comparison ◽  
Binary Matrix ◽  
Selection Scheme ◽  
Original Algorithm ◽  
Self Adaptive

Artificial Bee Colony (ABC) is a Swarm Intelligence optimization algorithm well known for its versatility. The selection of decision variables to update is purely stochastic, incurring several issues to the local search capability of the ABC. To address these issues, a self-adaptive decision variable selection mechanism is proposed with the goal of balancing the degree of exploration and exploitation throughout the execution of the algorithm. This selection, named Adaptive Decision Variable Matrix (A-DVM), represents both stochastic and deterministic parameter selection in a binary matrix and regulates the extent of how much each selection is employed based on the estimation of the sparsity of the solutions in the search space. The influence of the proposed approach to performance and robustness of the original algorithm is validated by experimenting on 15 highly multimodal benchmark optimization problems. Numerical comparison on those problems is made against the ABC and their variants and prominent population-based algorithms (e.g., Particle Swarm Optimization and Differential Evolution). Results show an improvement in the performance of the algorithms with the A-DVM in the most challenging instances.

scholarly journals FLC control for tuning exploration phase in bio-inspired metaheuristic

2017 ◽  
Vol 16 (2) ◽  
pp. 32
Author(s):  
Kazimierz Kiełkowicz ◽  
Damian Grela
Keyword(s):  
Fuzzy Logic Controller ◽  
Expert Knowledge ◽  
Bat Algorithm ◽  
Search Space ◽  
Search Process ◽  
Control Parameters ◽  
Local Search Methods ◽  
Multidimensional Search ◽  
Exploration Phase

<p>Growing popularity of the Bat Algorithm has encouraged researchers to focus their work on its further improvements. Most work has been done within the area of hybridization of Bat Algorithm with other metaheuristics or local search methods. Unfortunately, most of these modifications not only improves the quality of obtained solutions, but also increases the number of control parameters that are needed to be set in order to obtain solutions of expected quality. This makes such solutions quite impractical. What more, there is no clear indication what these parameters do in term of a search process. In this paper authors are trying to incorporate Mamdani type Fuzzy Logic Controller (FLC) to tackle some of these mentioned shortcomings by using the FLC to control the exploration phase of a bio-inspired metaheuristic. FLC also allows us to incorporate expert knowledge about the problem at hand and define expected behaviors of system – here process of searching in multidimensional search space by modeling the process of bats hunting for their prey.</p>

Comparison of Different Bat Initialization Techniques for Global Optimization Problems

2021 ◽  
Vol 12 (1) ◽  
pp. 157-184
Author(s):  
Wasqas Haider Bangyal ◽  
Jamil Ahmad ◽  
Hafiz Tayyab Rauf
Keyword(s):  
Global Optimization ◽  
Optimization Problems ◽  
Bat Algorithm ◽  
Search Space ◽  
Research Problem ◽  
Population Based ◽  
Premature Convergence ◽  
Ongoing Research ◽  
Low Discrepancy Sequences ◽  
Stochastic Search Technique

Bat algorithm (BA) is a population-based stochastic search technique that has been widely used to solve the diverse kind of optimization problems. Population initialization is the current ongoing research problem in evolutionary computing algorithms. Appropriate population initialization assists the algorithm to investigate the swarm search space effectively. BA faces premature convergence problem to find actual global optimization value. Low discrepancy sequences are slightly lesser random number than pseudo-random; however, they are more powerful for computational approaches. In this work, new population initialization approach Halton (BA-HA), Sobol (BA-SO), and Torus (BA-TO) are proposed, which helps bats to avoid from the premature convergence. The proposed approaches are examined on standard benchmark functions, and simulation results are compared with standard BA initialized with uniform distribution. The results depict that substantial enhancement can be attained in the performance of standard BA while varying the random numbers sequences to low discrepancy sequences.

Differential Evolution with Self-Adaptation

2011 ◽  
pp. 488-493 ◽  
Author(s):  
Janez Brest
Keyword(s):  
Global Optimization ◽  
Differential Evolution ◽  
Objective Function ◽  
Optimization Method ◽  
Control Parameters ◽  
Research Areas ◽  
De Algorithm ◽  
Practical Engineering ◽  
Self Adaptation ◽  
Self Adaptive

Many practical engineering applications can be formulated as a global optimization problem, in which objective function has many local minima, and derivatives of the objective function are unavailable. Differential Evolution (DE) is a floating-point encoding evolutionary algorithm for global optimization over continuous spaces (Storn & Price, 1997) (Liu & Lampinen, 2005) (Price, Storn & Lampinen, 2005) (Feoktistov, 2006). Nowadays it is used as a powerful global optimization method within a wide range of research areas. Recent researches indicate that self-adaptive DE algorithms are considerably better than the original DE algorithm. The necessity of changing control parameters during the optimization process is also confirmed based on the experiments in (Brest, Greiner, Boškovic, Mernik, Žumer, 2006a). DE with self-adaptive control parameters has already been presented in (Brest et al., 2006a). This chapter presents self-adaptive approaches that were recently proposed for control parameters in DE algorithm.

Insulin DNA Sequence Classification Using Levy Flight Bat With Back Propagation Algorithm

2020 ◽  
pp. 232-252
Author(s):  
Siyab Khan ◽  
Abdullah Khan ◽  
Rehan Ullah ◽  
Maria Ali ◽  
Rahat Ullah
Keyword(s):  
Dna Sequence ◽  
Dna Sequences ◽  
Optimization Problems ◽  
Back Propagation ◽  
Bat Algorithm ◽  
Hybrid Models ◽  
Lévy Flight ◽  
Healthy Human ◽  
Levy Flight ◽  
Nature Inspired Algorithms

Various nature-inspired algorithms are used for optimization problems. Recently, one of the nature-inspired algorithms became famous because of its optimality. In order to solve the problem of low accuracy, famous computational methods like machine learning used levy flight Bat algorithm for the problematic classification of an insulin DNA sequence of a healthy human, one variant of the insulin DNA sequence is used. The DNA sequence is collected from NCBI. Preprocessing alignment is performed in order to obtain the finest optimal DNA sequence with a greater number of matches between base pairs of DNA sequences. Further, binaries of the DNA sequence are made for the aim of machine readability. Six hybrid algorithms are used for the classification to check the performance of these proposed hybrid models. The performance of the proposed models is compared with the other algorithms like BatANN, BatBP, BatGDANN, and BatGDBP in term of MSE and accuracy. From the simulations results it is shown that the proposed LFBatANN and LFBatBP algorithms perform better compared to other hybrid models.

A New Differential Evolution Based Metaheuristic for Discrete Optimization

2012 ◽  
pp. 104-119 ◽  
Author(s):  
Ricardo Sérgio Prado ◽  
Rodrigo César Pedrosa Silva ◽  
Frederico Gadelha Guimarães ◽  
Oriane M. Neto
Keyword(s):  
Combinatorial Optimization ◽  
Differential Evolution ◽  
Discrete Optimization ◽  
Optimization Problems ◽  
Travelling Salesman Problem ◽  
Search Space ◽  
Combinatorial Problems ◽  
Search Mechanism ◽  
The Difference ◽  
Discrete Domains

The Differential Evolution (DE) algorithm is an important and powerful evolutionary optimizer in the context of continuous numerical optimization. Recently, some authors have proposed adaptations of its differential mutation mechanism to deal with combinatorial optimization, in particular permutation-based integer combinatorial problems. In this paper, the authors propose a novel and general DE-based metaheuristic that preserves its interesting search mechanism for discrete domains by defining the difference between two candidate solutions as a list of movements in the search space. In this way, the authors produce a more meaningful and general differential mutation for the context of combinatorial optimization problems. The movements in the list can then be applied to other candidate solutions in the population as required by the differential mutation operator. This paper presents results on instances of the Travelling Salesman Problem (TSP) and the N-Queen Problem (NQP) that suggest the adequacy of the proposed approach for adapting the differential mutation to discrete optimization.

scholarly journals A Hybrid Soft Computing Approach for Subset Problems

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Broderick Crawford ◽  
Ricardo Soto ◽  
Eric Monfroy ◽  
Carlos Castro ◽  
Wenceslao Palma ◽  
...  
Keyword(s):  
Optimization Problems ◽  
Hybrid Approach ◽  
Search Space ◽  
Constraint Satisfaction Problems ◽  
Combinatorial Problems ◽  
Set Partitioning ◽  
Set Covering ◽  
Packing And Covering ◽  
Arc Consistency ◽  
Hybrid Solver

Subset problems (set partitioning, packing, and covering) are formal models for many practical optimization problems. A set partitioning problem determines how the items in one set (S) can be partitioned into smaller subsets. All items inSmust be contained in one and only one partition. Related problems are set packing (all items must be contained in zero or one partitions) and set covering (all items must be contained in at least one partition). Here, we present a hybrid solver based on ant colony optimization (ACO) combined with arc consistency for solving this kind of problems. ACO is a swarm intelligence metaheuristic inspired on ants behavior when they search for food. It allows to solve complex combinatorial problems for which traditional mathematical techniques may fail. By other side, in constraint programming, the solving process of Constraint Satisfaction Problems can dramatically reduce the search space by means of arc consistency enforcing constraint consistencies either prior to or during search. Our hybrid approach was tested with set covering and set partitioning dataset benchmarks. It was observed that the performance of ACO had been improved embedding this filtering technique in its constructive phase.

scholarly journals Multimodal Optimization by Covariance Matrix Self-Adaptation Evolution Strategy with Repelling Subpopulations

2017 ◽  
Vol 25 (3) ◽  
pp. 439-471 ◽  
Author(s):  
Ali Ahrari ◽  
Kalyanmoy Deb ◽  
Mike Preuss
Keyword(s):  
Covariance Matrix ◽  
Optimization Problems ◽  
Search Space ◽  
Optimization Method ◽  
Evolution Strategy ◽  
Test Problems ◽  
Multimodal Optimization ◽  
Niching Methods ◽  
Self Adaptation ◽  
Adaptation Evolution

During the recent decades, many niching methods have been proposed and empirically verified on some available test problems. They often rely on some particular assumptions associated with the distribution, shape, and size of the basins, which can seldom be made in practical optimization problems. This study utilizes several existing concepts and techniques, such as taboo points, normalized Mahalanobis distance, and the Ursem’s hill-valley function in order to develop a new tool for multimodal optimization, which does not make any of these assumptions. In the proposed method, several subpopulations explore the search space in parallel. Offspring of a subpopulation are forced to maintain a sufficient distance to the center of fitter subpopulations and the previously identified basins, which are marked as taboo points. The taboo points repel the subpopulation to prevent convergence to the same basin. A strategy to update the repelling power of the taboo points is proposed to address the challenge of basins of dissimilar size. The local shape of a basin is also approximated by the distribution of the subpopulation members converging to that basin. The proposed niching strategy is incorporated into the covariance matrix self-adaptation evolution strategy (CMSA-ES), a potent global optimization method. The resultant method, called the covariance matrix self-adaptation with repelling subpopulations (RS-CMSA), is assessed and compared to several state-of-the-art niching methods on a standard test suite for multimodal optimization. An organized procedure for parameter setting is followed which assumes a rough estimation of the desired/expected number of minima available. Performance sensitivity to the accuracy of this estimation is also studied by introducing the concept of robust mean peak ratio. Based on the numerical results using the available and the introduced performance measures, RS-CMSA emerges as the most successful method when robustness and efficiency are considered at the same time.

Sign in / Sign up

Export Citation Format

Share Document