DOCSLIB.ORG

Towards the Self-Adaptation of the Bat Algorithm

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Towards the Self-Adaptation of the Bat Algorithm Proceedings of the IASTED International Conference Artificial Intelligence and Applications (AIA 2014) February 17 - 19, 2014 Innsbruck, Austria TOWARDS THE SELF-ADAPTATION OF THE BAT ALGORITHM Iztok Fister Jr.a, Simon Fongb, Janez Bresta, Iztok Fistera a University of Maribor, Faculty of Electrical Engineering and Computer Science, Smetanova 17, 2000 Maribor, Slovenia Email: iztok.fi[email protected], [email protected], iztok.fi[email protected] b University of Macau, Faculty of Science and Technology, Av. Padre Tomas Pereira, Taipa, Macau SAR Email: [email protected] ABSTRACT the natural behavior of different biological systems in or- Bat algorithm is one of the younger members of swarm in- der to solve particular problems using the digital comput- telligence algorithms that was introduced by Yang in 2010. ers. Adaptation is one of the more important characteristic So far, several variants based on this algorithm have been for surviving the individuals in biological systems that are proposed for coping with the continuous and discrete prob- subject to ruthless changing environment [8]. This mecha- lems. This paper introduces a novel self-adaptive bat algo- nism enables the individuals in biological systems to adapt rithm (SABA) that borrows the self-adapting mechanism themselves to the changing conditions within their environ- from self-adapted differential evolution known under the ments. The adaptation is not just a unique characteristic of name jDE. This algorithm was tested on ten benchmark the biological systems, because this mechanism has also functions taken from publications. The obtained results been incorporated into artificial systems and optimization were very promising and showed that this algorithm might algorithms. be very suitable for use, especially, in the continuous opti- The optimization algorithms are controlled by algo- mization. rithm parameters that can be changed deterministically, adaptively, and self-adaptively [9]. Deterministic param- KEY WORDS eters are altered by using some deterministic rule (e.g., bat algorithm, swarm intelligence, optimization, self- Rechenberg’s 1/5 success rule [10]). In contrast, adap- adaptation tive controlled parameters are subject to feedback from the search process that serves as an input to a mechanism 1 Introduction used that determines the direction and magnitude of the change [9]. Finally, the self-adaptive controlled parameters Nowadays, optimization has become more and more im- are encoded into representation of solution and undergo portant in domains, like finances, industries, sport, phar- acting the variation operators, like crossover and mutation macy, etc. The task of the optimization is to find the mini- in evolutionary algorithms [11]. mum or maximum of objective function relating to a prob- This paper proposes a self-adaptive bat algorithm lem that needs to be solved. Typically, the minimal costs (SABA) for continuous optimization. However, this self- of production are searched for in many industries. For ex- adaptive variant of a bat algorithm (BA) can also be later ample, the problem of how to finish a specific work order applied to real-world problems. An origin of the BA algo- with minimal material usage has arisen in the clothing in- rithm goes to the year 2010, when Xin-She Yang [12, 13, dustry [1]. However, the clothing industry is not alone ex- 14] created a new optimization algorithm inspired by the ample. behavior of micro-bats that use a special mechanism called The similar optimization problems have been arisen echolocation. Echolocation is used by bats for orientation in many industries that are efficiently solved using the well- and prey seeking. The original BA was applied to vari- known algorithms, like: ous benchmark functions, in which it achieved the good • artificial bee colony [2], results. The convergence rate was improved in study [3], where the authors hybridized the original BA with differ- • bat algorithm [3], ential evolution strategies (HBA). On the other hand, Wang and Guo [15] successfully hybridized the BA with a har- • differential algorithm [4], mony search (HS/BA) [16]. • firefly algorithm [5], The original bat algorithm employs two strategy pa- rameters: the pulse rate and the loudness. The former reg- • particle swarm optimization [6], and ulates an improving of the best solution, while the later • many more [7]. influences an acceptance of the best solution. Both the mentioned parameters are fixed during the execution of the The mentioned algorithms are generally inspired by original bat algorithm. In SABA, these parameters are self- nature. In these algorithms, developers wish to mimics adapted. The aim of this self-adaptation is twofold. On the DOI: 10.2316/P.2014.816-011 400 one hand, it is very difficult to guess the valid value of the Algorithm 1 Pseudo-code of the original bat algorithm T parameter. On the other hand, this value depends on the Input: Bat population xi = (xi1; : : : ; xiD) for i = phase in which the search process is. This means, the pa- 1 ::: Np; MAX FE. rameter setting at the beginning of the search process can Output: The best solution xbest and its corresponding be changed, when this process becomes matured. There- value fmin = min(f(x)). fore, the self-adaptation of these parameters is applied in 1: init bat(); SABA. 2: eval = evaluate the new population; The proposed SABA algorithm were applied to an 3: fmin = find best solution(xbest ); finitializationg optimization of a benchmark function suite consisting of 4: while termination condition not meet do 10 well-known functions from the publications. The ob- 5: for i = 1 to Np do tained results using SABA improved the results achieved 6: y = generate new solution(xi); by the original BA. Additionally, the proposed algorithm 7: if rand(0; 1) > ri then was compared also with the other well-known algorithms, 8: y = improve the best solution(xbest ) like firefly (FA) [5], differential evolution (DE) [17], and 9: end iff local search step g artificial bee colony (ABC) [18]. The results from this com- 10: fnew = evaluate new solution(y); parison showed that the results of the SABA are compara- 11: eval = eval + 1; ble with the results of the other up-to-date algorithms. 12: if fnew ≤ fi and N(0; 1) < Ai then The structure of this paper is as follows. Section 2 13: xi = y; fi = fnew; presents the original bat algorithms. The self-adaptive bat 14: end iff save best solution conditionaly g algorithm is described in Section 3. Section 4 illustrates 15: fmin =find best solution(xbest ); the experiments and results detailed. The paper concludes 16: end for by summarizing the performed work and outlines further 17: end while directions for development. 2 The original bat algorithm operation of the original BA algorithm presented in Algo- rithm 1 can be described as follows. In general, the algo- The original bat algorithm was developed in 2010 by Xin- rithm consists of the following components [19]: She Yang [12, 13, 14]. The inspiration for his work came from behavior of micro-bats and especially, their special • initialization (lines 1-3): initializing the algorithm pa- mechanism named echolocation. Echolocation is a mech- rameters, generating the initial population, evaluating anism that bats use for orientation and finding the preys. it, and searching for the best solution xbest in the ini- Bats are not the only creatures using such a mechanism. tial population, For instance, dolphins use this mechanism for finding prey • generate new solution (line 6): moving the virtual in the seas [19]. bats in the search space according to physical rules Nowadays, BA and its variants are applied for solv- of bat echolocation, ing many optimization and classification problems, as well as several engineering problems in practice. In detail, the • local search step (lines 7-9): improving the best so- taxonomy of the developed BA applications is represented lution using random walk direct exploitation (RWDE) in [19], where the applications of BA algorithms have been heuristic [20], divided into the following classes of optimization prob- lems: continuous, constrained, and multi-objective. In ad- • evaluate new solution (line 10): evaluating the new dition, they were also used for classification problems, like solution, clustering, neural networks, and feature selection. Finally, • save best solution conditionaly (lines 12-14): saving BAs were used in many branches of engineering, e.g., im- the new best solution under some probability A sim- age processing, industrial design, scheduling, electronics, i ilar to simulated annealing [21], spam filtering, and even in sport. The original bat algorithm is population based, where • find best solution (line 15): searching for the current each individual represents the candidate solution. The best solution. candidate solutions are represented as vectors xi = T (xi1; : : : ; xiD) for i = 1 ::: Np with real-valued elements Note that these components are denoted in the al- xij, where each elements can capture values from interval gorithm either as function names, when the function call xij 2 [xlb; xub]. Thus, xlb and xub denote the correspond- is performed in one line or as a component name desig- ing lower and upper bound, while the population size is nated by a comment between two curly brackets, when determined by Np parameter. it comprises more lines. Initialization of the bat popula- The pseudo-code of the original BA algorithm is il- tion consist of tree steps. At first, the population is ini- lustrated in Algorithm 1, where bats’ behavior is captured tialized randomly (in function init bat). Then, solutions within the fitness function of the problem to be solved. The are evaluated (in function evaluate the new population) 401 and finally, the current best solution is found (in function 3 The self-adaptive bat algorithm find best solution). Generating the new solutions is per- formed according to the following equations: Self-adaptation of control parameters means that the algo- rithms control parameters (also strategy parameters) are en- coded into representation of a candidate solution and un- dergo acting the variation operators.
Load more

Recommended publications
  • An Overview of Mutation Strategies in Bat Algorithm
    (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 9, No. 8, 2018 An Overview of Mutation Strategies in Bat Algorithm 3 Waqas Haider Bangyal1 Hafiz Tayyab Rauf Member IEEE SMC Department of Computer Science, Department of Computer Science, University of Gujrat, Iqra University, Islamabad, Pakistan Gujrat, Pakistan 4 Jamil Ahmad2 Sobia Pervaiz Senior Member IEEE, Professor Computer Science Department of Software Engineering, Department of Computer Science, University of Gujrat, Kohat University of Science and Technology (KUST), Gujrat, Pakistan Kohat, Pakistan Abstract—Bat algorithm (BA) is a population based stochastic embedding the qualities of social insects’ behavior in the form search technique encouraged from the intrinsic manner of bee of swarms such as bees, wasps and ants, and flocks of fishes swarm seeking for their food source. BA has been mostly used to and birds. SI first inaugurated by Beni [4] in cellular robotics resolve diverse kind of optimization problems and one of major system. Researchers are attracted with the behavior of flocks of issue faced by BA is frequently captured in local optima social insects from many years. The individual member of meanwhile handling the complex real world problems. Many these flocks can achieve hard tasks with the help of authors improved the standard BA with different mutation collaboration among others [5]; however, such colonies behave strategies but an exhausted comprehensive overview about without any centralized control. SI is very famous in bio- mutation strategies is still lacking. This paper aims to furnish a inspired algorithms, computer science, and computational concise and comprehensive study of problems and challenges that intelligence.
    [Show full text]
  • An Improved Bees Algorithm Local Search Mechanism for Numerical Dataset
    An Improved Bees Algorithm Local Search Mechanism for Numerical dataset Prepared By: Aras Ghazi Mohammed Al-dawoodi Supervisor: Dr. Massudi bin Mahmuddin DISSERTATION SUBMITTED TO THE AWANG HAD SALLEH GRADUATE SCHOOL OF COMPUTING UUM COLLEGE OF ARTS AND SCIENCES UNIVERSITI UTARA MALAYSIA IN PARITIAL FULFILLMENT OF THE REQUIREMENT FOR THE DEGREE OF MASTER IN (INFORMATION TECHNOLOGY) 2014 - 2015 Permission to Use In presenting this dissertation report in partial fulfilment of the requirements for a postgraduate degree from University Utara Malaysia, I agree that the University Library may make it freely available for inspection. I further agree that permission for the copying of this report in any manner, in whole or in part, for scholarly purpose may be granted by my supervisor(s) or, in their absence, by the Dean of Awang Had Salleh Graduate School of Arts and Sciences. It is understood that any copying or publication or use of this report or parts thereof for financial gain shall not be allowed without my written permission. It is also understood that due recognition shall be given to me and to University Utara Malaysia for any scholarly use which may be made of any material from my report. Requests for permission to copy or to make other use of materials in this project report, in whole or in part, should be addressed to: Dean of Awang Had Salleh Graduate School of Arts and Sciences UUM College of Arts and Sciences University Utara Malaysia 06010 UUM Sintok i Abstrak Bees Algorithm (BA), satu prosedur pengoptimuman heuristik, merupakan salah satu teknik carian asas yang berdasarkan kepada aktiviti pencarian makanan lebah.
    [Show full text]
  • Make Robots Be Bats: Specializing Robotic Swarms to the Bat Algorithm
    © <2019>. This manuscript version is made available under the CC- BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc- nd/4.0/ Accepted Manuscript Make robots Be Bats: Specializing robotic swarms to the Bat algorithm Patricia Suárez, Andrés Iglesias, Akemi Gálvez PII: S2210-6502(17)30633-8 DOI: 10.1016/j.swevo.2018.01.005 Reference: SWEVO 346 To appear in: Swarm and Evolutionary Computation BASE DATA Received Date: 24 July 2017 Revised Date: 20 November 2017 Accepted Date: 9 January 2018 Please cite this article as: P. Suárez, André. Iglesias, A. Gálvez, Make robots Be Bats: Specializing robotic swarms to the Bat algorithm, Swarm and Evolutionary Computation BASE DATA (2018), doi: 10.1016/j.swevo.2018.01.005. This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. ACCEPTED MANUSCRIPT Make Robots Be Bats: Specializing Robotic Swarms to the Bat Algorithm Patricia Su´arez1, Andr´esIglesias1;2;:, Akemi G´alvez1;2 1Department of Applied Mathematics and Computational Sciences E.T.S.I. Caminos, Canales y Puertos, University of Cantabria Avda. de los Castros, s/n, 39005, Santander, SPAIN 2Department of Information Science, Faculty of Sciences Toho University, 2-2-1 Miyama 274-8510, Funabashi, JAPAN :Corresponding author: [email protected] http://personales.unican.es/iglesias Abstract Bat algorithm is a powerful nature-inspired swarm intelligence method proposed by Prof.
    [Show full text]
  • An Analysis of Foraging and Echolocation Behavior of Swarm Intelligence Algorithms in Optimization: ACO, BCO and BA
    International Journal of Intelligence Science, 2018, 8, 1-27 http://www.scirp.org/journal/ijis ISSN Online: 2163-0356 ISSN Print: 2163-0283 An Analysis of Foraging and Echolocation Behavior of Swarm Intelligence Algorithms in Optimization: ACO, BCO and BA Tanzila Islam, Md Ezharul Islam, Mohammad Raihan Ruhin Department of Computer Science and Engineering, Jahangirnagar University, Dhaka, Bangladesh How to cite this paper: Islam, T., Islam, Abstract M.E. and Ruhin, M.R. (2018) An Analysis of Foraging and Echolocation Behavior of Optimization techniques are stimulated by Swarm Intelligence wherever the Swarm Intelligence Algorithms in Optimi- target is to get a decent competency of a problem. The knowledge of the beha- zation: ACO, BCO and BA. International vior of animals or insects has a variety of models in Swarm Intelligence. Journal of Intelligence Science, 8, 1-27. Swarm Intelligence has become a potential technique for evolving many ro- https://doi.org/10.4236/ijis.2018.81001 bust optimization problems. Researchers have developed various algorithms Received: December 19, 2017 by modeling the behaviors of the different swarm of animals or insects. This Accepted: January 28, 2018 paper explores three existing meta-heuristic methods named as Ant Colony Published: January 31, 2018 Optimization (ACO), Bee Colony Optimization (BCO) and Bat Algorithm (BA). Ant Colony Optimization was stimulated by the nature of ants. Bee Co- Copyright © 2018 by authors and Scientific Research Publishing Inc. lony Optimization was inspired by the plundering behavior of honey bees. Bat This work is licensed under the Creative Algorithm was emerged on the echolocation characteristics of micro bats.
    [Show full text]
  • Survivable Networks Via UAV Swarms Guided by Decentralized Real-Time
    Survivable Networks via UAV Swarms Guided by Decentralized Real-Time Evolutionary Computation George Leu Jiangjun Tang School of Engineering and Information Technology School of Engineering and Information Technology UNSW Canberra UNSW Canberra Canberra, Australia Canberra, Australia [email protected] [email protected] Abstract—The survivable network concept refers to contexts to provide ground network survivability regardless of the where the wireless communication between ground agents needs ground agents’ movements. To address the challenges men- to be maintained as much as possible at all times, regardless tioned above, we propose an implementation of the UAVs’ of any adverse conditions that may arise. In this paper we propose a nature-inspired approach to survivable networks, in mobility which is inspired from the classic boids model of which we bring together swarm intelligence and evolutionary Reynolds [4]. The proposed model uses modified versions computation. We use an on-line real-time Genetic Algorithm to of the two key concepts of the classic boids: the interaction optimize the movements of an UAV swarm towards maintain- based on the concept of neighborhood, and the position update ing communication between the ground agents. The proposed rule based on the weighted sum of a set of primitive forces. approach models the ground agents and the UAVs as boids- based swarms, and optimizes the movement of the UAVs using The modifications we propose are that the neighborhood is different instances of the GA running independently on each UAV. network-based [5] instead of the classic vision-based [4], and The UAV coordination mechanism is an implicit one, embedded the update rule includes forces from outside the swarm, not in the fitness function of the Genetic Algorithm instances.
    [Show full text]
  • Arxiv:1303.6310V3 [Cs.NE] 5 Jun 2013
    A Hybrid Bat Algorithm Iztok Fister Jr.,∗ DuˇsanFister,† and Xin-She Yang‡ Abstract Swarm intelligence is a very powerful technique to be used for optimization purposes. In this paper we present a new swarm intelligence algorithm, based on the bat algorithm. The Bat algorithm is hybridized with differential evolution strategies. Besides showing very promising results of the standard benchmark functions, this hybridization also significantly improves the original bat algorithm. To cite paper as follows: I. Jr. Fister, D. Fister, X.-S Yang. A hybrid bat algorithm. Elek- trotehniˇskivestnik, 2013, in press. arXiv:1303.6310v3 [cs.NE] 5 Jun 2013 ∗University of Maribor, Faculty of electrical engineering and computer science Smetanova 17, 2000 Maribor; Electronic address: iztok.fi[email protected] †University of Maribor, Faculty of mechanical engineering Smetanova 17, 2000 Maribor; Electronic address: dusan.fi[email protected] ‡Middlesex University, School of Science and Technology London NW4 4BT, UK; Electronic address: [email protected] 1 I. INTRODUCTION Nature has always been an inspiration for researchers. In the past, many new nature- inspired algorithms have been developed to solve hard problems in optimization. In general, there are two main concepts developed in bio-inspired computation: 1. evolutionary algorithms, 2. swarm intelligence algorithms. The Evolutionary algorithms are optimization techniques [7] that base on the Darwin's principle of survival of the fittest [5]. It states that in nature the fittest indivi- duals have greater chances to survive. The Evolutionary algorithms consist of the follow- ing disciplines: genetic algorithms, evolution strategies, genetic programming, evolutionary programming, differential evolution. Although all these algorithms or methods have been developed independently, they share similar characteristics (like variation operators, selection operators) when solving problems.
    [Show full text]
  • Bat Algorithm Based Investigation and Application on Several Domains
    Citation Umar, S.U. and Rashid, T.A. (2021), "Critical analysis: bat algorithm-based investigation and application on several domains", World Journal of Engineering, Vol. ahead-of-print No. ahead-of-print. https://doi.org/10.1108/WJE-10-2020-0495 Critical Analysis: Bat Algorithm based Investigation and Application on Several Domains Shahla U. Umar1,2,*, Tarik A. Rashid3 1Technical College of Informatics, Sulaimani Polytechnic University, Sulaimani, KRG, Iraq 2Network Department, College of Computer Science and Information Technology, Kirkuk University, Kirkuk, Iraq. 3Computer Science and Engineering, School of Science and Engineering, University of Kurdistan Hewler, Erbil- KRG, Iraq. *corresponding author: [email protected] Abstract In recent years several swarm optimization algorithms, such as Bat Algorithm (BA) have emerged, which was proposed by Xin-She Yang in 2010. The idea of the algorithm was taken from the echolocation ability of bats. Purpose- The purpose of this study is to provide the reader with a full study of the Bat Algorithm, including its limitations, the fields that the algorithm has been applied, versatile optimization problems in different domains, and all the studies that assess its performance against other meta-heuristic algorithms. Design/Methodology/Approach- Bat Algorithm is given in-depth in terms of backgrounds, characteristics, limitations, it has also displayed the algorithms that hybridized with BA (K-Medoids, Back-propagation neural network, Harmony Search Algorithm, Differential Evaluation Strategies, Enhanced Particle Swarm Optimization, and Cuckoo Search Algorithm) and their theoretical results, as well as to the modifications that have been performed of the algorithm (Modified Bat Algorithm (MBA), Enhanced Bat Algorithm (EBA), Bat Algorithm with Mutation (BAM), Uninhabited Combat Aerial Vehicle-Bat algorithm with Mutation (UCAV-BAM), Nonlinear Optimization).
    [Show full text]
  • A New Hybrid BA ABC Algorithm for Global Optimization Problems
    mathematics Article A New Hybrid BA_ABC Algorithm for Global Optimization Problems Gülnur Yildizdan 1,* and Ömer Kaan Baykan 2 1 Kulu Vocational School, Selcuk University, Kulu, 42770 Konya, Turkey 2 Department of Computer Engineering, Faculty of Engineering and Natural Sciences, Konya Technical University, 42250 Konya, Turkey; [email protected] * Correspondence: [email protected] Received: 1 September 2020; Accepted: 21 September 2020; Published: 12 October 2020 Abstract: Bat Algorithm (BA) and Artificial Bee Colony Algorithm (ABC) are frequently used in solving global optimization problems. Many new algorithms in the literature are obtained by modifying these algorithms for both constrained and unconstrained optimization problems or using them in a hybrid manner with different algorithms. Although successful algorithms have been proposed, BA’s performance declines in complex and large-scale problems are still an ongoing problem. The inadequate global search capability of the BA resulting from its algorithm structure is the major cause of this problem. In this study, firstly, inertia weight was added to the speed formula to improve the search capability of the BA. Then, a new algorithm that operates in a hybrid manner with the ABC algorithm, whose diversity and global search capability is stronger than the BA, was proposed. The performance of the proposed algorithm (BA_ABC) was examined in four different test groups, including classic benchmark functions, CEC2005 small-scale test functions, CEC2010 large-scale test functions, and classical engineering design problems. The BA_ABC results were compared with different algorithms in the literature and current versions of the BA for each test group. The results were interpreted with the help of statistical tests.
    [Show full text]
  • Nature Inspired Computing: Algorithms, Performance and Applications
    Nature Inspired Computing: Algorithms, Performance and Applications Submitted in partial fulfillment of the requirements of the degree of Doctor of Philosophy by Rohit Salgotra (UID: 901606022) Supervisor Dr. Urvinder Singh (Associate Professor) Department of Electronics & Communication Engineering THAPAR INSTITUTE OF ENGG. & TECHNOLOGY July 2020 Dedicated to The Grand Weaver of my life, MY PAREN T S Approval of Doctoral Committee Certified that the thesis entitled "Nature Inspired Computing: Algorithms, Perfor- mance and Applications" submitted by Mr. Rohit Salgotra to the Thapar Institute of Engineering & Technology, Patiala for the award of "Doctor of Philosophy" has been accepted by the doctoral committee members. Dr. Paramartha Dutta Dr. Urvinder Singh External Examiner Supervisor Department of Computer & system Sciences Dept. of Electronics & Communication Visva Bharati University, West Bengal Thapar Institute of Engg. & Tech, Patiala Dr. Alpana Aggarwal Dr. Kulbir Singh Chairperson, Doctoral Committee Member, Doctoral Committee Dept. of Electronics & Communication Dept. of Electronics & Communication Thapar Institute of Engg. & Tech, Patiala Thapar Institute of Engg. & Tech, Patiala Dr. Neeraj Kumar Dr. Vinay Kumar Member, Doctoral Committee Member, Doctoral Committee Dept. of Computer Science & Engg. Dept. of Electronics & Communication Thapar Institute of Engg. & Tech, Patiala Thapar Institute of Engg. & Tech, Patiala Date: July 2020 Place: Patiala, India Statement of Originality This is to certify that: • All the written material submitted in this thesis is my original work and any idea or words which have been added are adequately cited and referenced from the original source. • The work presented in this thesis has never been used for any other degree or diploma course and I adhere to academic integrity and honesty and have not falsified or misrepresented or fabricated any data or fact or idea or source in my submission.
    [Show full text]
  • A 2020 Taxonomy of Algorithms Inspired on Living Beings Behavior
    A 2020 TAXONOMY OF ALGORITHMS INSPIRED ON LIVING BEINGS BEHAVIOR APREPRINT Luis M. Torres-Treviño∗ Posgrado en Ingeniería Eléctrica Universidad Autónoma de Nuevo león Ciudad Universitaria S/N, San Nicolás de los Garza, Nuevo León, México [email protected] June 10, 2021 ABSTRACT Taking the role of a computer naturalist, a journey is taken through bio inspired algorithms taking account on algorithms which are inspired on living being behaviors. A compilation of algorithms is made considering several reviews or surveys of bio-inspired heuristics and swarm intelligence until 2020 year. A classification is made considering kingdoms as used by biologists generating several branches for animalia, bacteria, plants, fungi and Protista to develop a taxonomy. Keywords Behavior of living beings · Bio inspired algorithms · Swarm intelligence 1 Introduction Since the emerge of ideas about simulation of life in last decades, several algorithms have been proposed to solve complex problems inspired on nature phenomena; i.e. evolutionary computation or artificial life. A role of a naturalist or biologist is taken with the purpose for studying all living forms in a new ecosystem and trying to make a classification of all discoveries to form a taxonomy of living beings. This role is taken as a computer naturalist to make a compilation of algorithms inspired on behavior of living beings. There are several bio-inspired algorithms; however, this work focus on actions of living beings like the growth of plants, reproduction of mushrooms, living of bacteria, the individuals behavior of animals, etc.; however, highlights the interactions between individuals of a group of different animals like school of fishes, flock of birds, herd of mammals, or swarm of insects.
    [Show full text]
  • Mba-Lf: a New Data Clustering Method Using Modified Bat Algorithm and Levy Flight
    ISSN: 2229-6956 (ONLINE) ICTACT JOURNAL ON SOFT COMPUTING, OCTOBER 2015, VOLUME: 06, ISSUE: 01 DOI: 10.21917/ijsc.2015.0151 MBA-LF: A NEW DATA CLUSTERING METHOD USING MODIFIED BAT ALGORITHM AND LEVY FLIGHT R. Jensi1 and G. Wiselin Jiji2 Department of Computer Science and Engineering, Dr. Sivanthi Aditanar College of Engineering, India E-mail: [email protected], [email protected] Abstract Foraging Optimization (BFO) [16]-[17], the Bees Algorithm Data clustering plays an important role in partitioning the large set of [18], Artificial Bee Colony algorithm (ABC) [19]-[21], data objects into known/unknown number of groups or clusters so that Biogeography-based optimization (BBO) [22] , Cuckoo Search the objects in each cluster are having high degree of similarity while (CS) [23]-[24], Firefly Algorithm (FA) [25]-[26] , Bat Algorithm objects in different clusters are dissimilar to each other. Recently a (BA) [27] ,flower pollination algorithm[28] and Krill herd number of data clustering methods are explored by using traditional algorithm [29]. methods as well as nature inspired swarm intelligence algorithms. In Swarm Intelligence system holds a population of solutions, this paper, a new data clustering method using modified bat algorithm is presented. The experimental results show that the proposed which are changed through random selection and alterations of algorithm is suitable for data clustering in an efficient and robust way. these solutions. The way, the system differs depends on the generation of new solutions, random selection procedure and candidate solution encoding technique. Particle Swarm Keywords: Optimization (PSO) was developed in 1995 by Kennedy and Data Clustering, Bat Algorithm, Levy Flight, Global Optimization Eberhart simulating the social behaviour of bird flock or fish school.
    [Show full text]
  • Weighted Mean Variant with Exponential Decay Function of Grey Wolf Optimizer Under Swarm Based Algorithm
    Weighted mean variant with exponential decay function of Grey Wolf Optimizer under Swarm Based Algorithm Alok Kumar1, Avjeet Singh2, Lekhraj3, Anoj Kumar4 1,2,3,4 Motilal Nehru National Institute of Technology, Allahabad, Computer Science and Engineering Department, {alokkumar, 2016rcs01, lekhraj, anojk}@mnnit.ac.in1,2,3,4 Abstract. Nature-Inspired Meta-heuristic algorithms are optimization algorithms those are becoming famous day by day from last two decades for the researcher with many key features like diversity, simplicity, proper balance between exploration and exploitation, high convergence rate, avoidance of stagnation, flexibility, etc. There are many types of nature inspired meta- heuristics algorithms employed in many different research areas in order to solve complex type of problems that either single-objective or multi-objective in nature. Grey Wolf Optimizer (GWO) is one most powerful, latest and famous meta-heuristic algorithm which mimics the leadership hierarchy which is the unique property that differentiates it from other algorithms and follows the hunting behavior of grey wolves that found in Eurasia and North America. To implement the simulation, alpha, beta, delta, and omega are four levels in the hierarchy and alpha is most powerful and leader of the group, so forth respectively. No algorithm is perfect and hundred percent appropriate, i.e. replacement, addition and elimination are required to improve the performance of each and every algorithm. So, this work proposed a new variant of GWO namely, Weighted Mean GWO (WMGWO) with an exponential decay function to improve the performance of standard GWO and their many variants. The performance analysis of proposed variant is evaluated by standard benchmark functions.
    [Show full text]