DOCSLIB.ORG

Improved Versions of the Bees Algorithm for Global Optimisation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Improved Versions of the Bees Algorithm for Global Optimisation IMPROVED VERSIONS OF THE BEES ALGORITHM FOR GLOBAL OPTIMISATION By SHAFIE KAMARUDDIN A thesis submitted to the University of Birmingham for the degree of DOCTOR OF PHILOSOPHY Department of Mechanical Engineering School of Engineering College of Engineering and Physical Sciences University of Birmingham June 2017 University of Birmingham Research Archive e-theses repository This unpublished thesis/dissertation is copyright of the author and/or third parties. The intellectual property rights of the author or third parties in respect of this work are as defined by The Copyright Designs and Patents Act 1988 or as modified by any successor legislation. Any use made of information contained in this thesis/dissertation must be in accordance with that legislation and must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the permission of the copyright holder. ABSTRACT This research focuses on swarm-based optimisation algorithms, specifically the Bees Algorithm. The basic version of the algorithm was introduced in 2005 and was inspired by the foraging behaviour of honey bees in nature. The Bees Algorithm employs a combination of exploration and exploitation to find the solutions of optimisation problems. This thesis presents three improved versions of the Bees Algorithm aimed at speeding up its operation and facilitating the location of the global optimum. For the first improvement, an algorithm referred to as the Nelder and Mead Bees Algorithm (NMBA) was developed to provide a guiding direction during the neighbourhood search stage. The second improved algorithm, named the recombination-based Bees Algorithm (rBA), is a variant of the Bees Algorithm that utilises a recombination operator between the exploited and abandoned sites to produce new candidates closer to optimal solutions. The third improved Bees Algorithm, called the guided global best Bees Algorithm (gBA), introduces a new neighbourhood shrinking strategy based on the best solution so far for a more effective exploitation search and develops a new bee recruitment mechanism to reduce the number of parameters. The proposed algorithms were tested on a set of unconstrained numerical functions and constrained mechanical engineering design problems. The performance of the algorithms on numerical functions was compared with the standard Bees Algorithm and other swarm based algorithms in terms of the solutions found and the convergence speed. In terms of the application on constraint mechanical engineering design problems, the performance was compared with the results of the standard Bees Algorithm and the results of other algorithms in the literature. In addition, a paired test statistical analysis was also carried out on those results. i The results showed that the improved Bees Algorithms performed better than the standard Bees Algorithm and other algorithms on most of the problems tested. Furthermore, the algorithms also involve no additional parameters and a reduction on the number of parameters as well. ii ACKNOWLEDGEMENTS First and foremost, gratitude and Praise is to Allah, the Most Merciful and Most Compassionate for His Blessings, that I am to complete this research. I would also like to record my appreciation to these outstanding individuals for their great contributions: I am deeply indebted to my supervisor, Prof. D T Pham for all his guidance, advices, knowledge and supervision that guided me throughout my academic program. His immeasurable supports and confidence in me inspired me to complete this thesis. In addition, I also would like to thanks my wife, Dahlia Nursyarmimi and all my family members for always supporting me during my PhD journey. Furthermore, I would like also to express my outermost appreciation to all my colleagues, Muhammad Syahril, Nik Mohd Farid, Dr. Silah Hayati, Al Antoni Akhmad and other closet friends for their encouragements and advices during my research period Also, special thanks to my sponsor, the Ministry of Higher Education (MOHE) of Malaysia and International Islamic University Malaysia (IIUM) for giving me the opportunity to further my study. Lastly, I offer my regards and blessing to all of those supported me in any respect during completion of the research. This thesis was copy edited for conventions of language, spelling, and grammar by Szakif Enterprise Academic Services. iii TABLE OF CONTENTS ABSTRACT ............................................................................................................................... i ACKNOWLEDGEMENTS .................................................................................................. iii TABLE OF CONTENTS ....................................................................................................... iv LIST OF FIGURES ............................................................................................................... vii LIST OF TABLES .................................................................................................................. ix LIST OF SYMBOLS AND ABBREVIATIONS .................................................................. xi Chapter 1: Introduction ......................................................................................................... 1 1.1 Background ...................................................................................................................... 1 1.2 Motivation ........................................................................................................................ 1 1.3 Aim and Objectives.......................................................................................................... 3 1.4 Research Methodology .................................................................................................... 4 1.5 Outline of the Thesis ........................................................................................................ 4 Chapter 2: Literature Review ................................................................................................. 6 2.1 Preliminaries .................................................................................................................... 6 2.2 Optimisation ..................................................................................................................... 6 2.2 Direct Search Methods ..................................................................................................... 8 2.2.1 Nelder and Mead Method ......................................................................................... 8 2.2.2 Hooke and Jeeves Method ........................................................................................ 9 2.3 Metaheuristic.................................................................................................................. 10 2.4 Single-solution based metaheuristics ............................................................................. 11 2.4.1 Simulated Annealing (SA) ...................................................................................... 12 2.4.2 Tabu Search (TS) .................................................................................................... 12 2.4.3 Iterated Local Search (ILS) ..................................................................................... 13 2.5 Population-based metaheuristics .................................................................................... 13 2.5.1 Evolutionary Computation (EC) ............................................................................. 14 2.5.2 Nature inspired Swarm Intelligence (SI) ................................................................ 17 2.5.2.1 Firefly Algorithm (FA) .................................................................................... 18 iv 2.5.2.2 Ant Colony Optimisation (ACO) ..................................................................... 19 2.5.2.3 Particle Swarm Optimisation (PSO) ................................................................ 19 2.5.2.4 Honey Bees Inspired Algorithm ...................................................................... 20 2.6 The Bees Algorithm ....................................................................................................... 28 2.7 Improvements ................................................................................................................ 30 2.8 Applications ................................................................................................................... 35 2.9 Summary ........................................................................................................................ 39 Chapter 3: The Bees Algorithm with Nelder and Mead Method ...................................... 40 3.1 Preliminaries .................................................................................................................. 40 3.2 The Bees Algorithm with Nelder and Mead (NM) Method .......................................... 41 3.2.1 Experimental Setup ................................................................................................. 45 3.2.2 Experimental Results .............................................................................................. 48 3.2.3 Discussion ............................................................................................................... 55 3.3 Mechanical Design Applications ................................................................................... 58 3.4 Summary .......................................................................................................................
Load more

Recommended publications
  • Application of the Firefly Algorithm for Optimal Production and Demand Forecasting at Selected Industrial Plant
    Open Journal of Business and Management, 2020, 8, 2451-2459 https://www.scirp.org/journal/ojbm ISSN Online: 2329-3292 ISSN Print: 2329-3284 Application of the Firefly Algorithm for Optimal Production and Demand Forecasting at Selected Industrial Plant Abdulhadi Altherwi Industrial and Systems Engineering Department, Oakland University, Rochester, MI, USA How to cite this paper: Altherwi, A. (2020). Abstract Application of the Firefly Algorithm for Optimal Production and Demand Fore- Many production companies continue to face financial difficulties. The main casting at Selected Industrial Plant. Open purpose of this paper is to present an effective method for these companies to Journal of Business and Management, 8, maximize profits and minimize production costs. The problem presented 2451-2459. https://doi.org/10.4236/ojbm.2020.86151 here is initially developed as a linear programming model. To achieve the best results, the firefly algorithm (FA) is applied to solve the model and obtain an Received: October 15, 2020 optimum solution. In order to test the efficiency of the algorithm, Lindo Accepted: November 13, 2020 software is used, and the results of both algorithms are compared. A sensitiv- Published: November 16, 2020 ity analysis is applied to determine which products a company should pro- Copyright © 2020 by author(s) and duce in order to maximize profits. The result reveals that the FA, when com- Scientific Research Publishing Inc. pared with Lindo, can help achieve maximum profits by producing only one This work is licensed under the Creative product, thus minimizing production costs. For demand forecasting, the Commons Attribution International License (CC BY 4.0).
    [Show full text]
  • An Exhaustive Review of Bio-Inspired Algorithms and Its Applications for Optimization in Fuzzy Clustering
    Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 10 March 2021 doi:10.20944/preprints202103.0282.v1 Article An Exhaustive Review of Bio-Inspired Algorithms and its Applications for Optimization in Fuzzy Clustering Fevrier Valdez1, Oscar Castillo1,* and Patricia Melin1 1 Division Graduate of Studies, Tijuana Institute of Technology, Calzada Tecnologico S/N, Tijuana, 22414, BC, Mexico. Tel.: 664 607 8400 * Correspondence: [email protected]; Tel.: 664 607 8400 1 Abstract: In recent years, new metaheuristic algorithms have been developed taking as reference 2 the inspiration on biological and natural phenomena. This nature-inspired approach for algorithm 3 development has been widely used by many researchers in solving optimization problem. These 4 algorithms have been compared with the traditional ones algorithms and have demonstrated to 5 be superior in complex problems. This paper attempts to describe the algorithms based on nature, 6 that are used in fuzzy clustering. We briefly describe the optimization methods, the most cited 7 nature-inspired algorithms published in recent years, authors, networks and relationship of the 8 works, etc. We believe the paper can serve as a basis for analysis of the new are of nature and 9 bio-inspired optimization of fuzzy clustering. 10 11 Keywords: FUZZY; CLUSTERING; OPTIMIZATION ALGORITHMS 12 1. Introduction 13 Optimization is a discipline for finding the best solutions to specific problems. 14 Every day we developed many actions, which we have tried to improve to obtain the 15 best solution; for example, the route at work can be optimized depending on several 16 factors, as traffic, distance, etc. On other hand, the design of the new cars implies an 17 optimization process with many objectives as wind resistance, reduce the use of fuel, Citation: Valdez, F.; Castillo, O.; Melin, 18 maximize the potency of motor, etc.
    [Show full text]
  • Distributed Cognition As the Basis for Adaptation and Homeostasis In
    DISTRIBUTEDCOGNITIONASTHEBASISFORADAPTATION ANDHOMEOSTASISINROBOTS james henry stovold Doctor of Philosophy University of York Computer Science July 2016 ABSTRACT Many researchers approach the problem of building autonomous systems by looking to biology for inspiration. This has given rise to a wide-range of artificial systems mimicking their biological counterparts—artificial neural networks, artificial endocrine systems, and artificial musculoskeletal systems are prime examples. While these systems are succinct and work well in isolation, they can become cumbersome and complicated when combined to perform more complex tasks. Autonomous behaviour is one such complex task. This thesis considers autonomy as the complex behaviour it is, and proposes a bottom-up approach to developing autonomous beha- viour from cognition. This consists of investigating how cognition can provide new approaches to the current limitations of swarm systems, and using this as the basis for one type of autonomous behaviour: artificial homeostasis. Distributed cognition, a form of emergent cognition, is most often described in terms of the immune system and social insects. By taking inspiration from distributed cognition, this thesis details the development of novel algorithms for cognitive decision-making and emergent identity in leaderless, homogenous swarms. Artificial homeostasis is provided to a robot through an architecture that combines the cognitive decision-making algorithm with a simple associative memory. This architecture is used to demonstrate how a simple architecture can endow a robot with the capacity to adapt to an unseen environment, and use that information to proactively seek out what it needs from the environment in order to maintain its internal state. iii CONTENTS Abstract iii Table of Contents v List of Figures viii List of Tables xi List of Code Listings xii Acknowledgements xiii Declaration xv 1 introduction 1 1.1 Motivation .
    [Show full text]
  • Evolving Behaviour Trees for Supervisory Control of Robot Swarms
    Evolving Behaviour Trees for Supervisory Control of Robot Swarms Elliott Hogg1y, Sabine Hauert1, David Harvey, Arthur Richards1 1Bristol Robotics Laboratory, University of Bristol, UK. E-mail: [email protected], [email protected] Abstract: Supervisory control of swarms is essential to their deployment in real world scenarios to both monitor their operation and provide guidance. We explore mechanisms by which humans might provide supervisory control to swarms and improve their performance. Rather than have humans guess the correct form of supervisory control, we use artificial evolution to learn effective human-readable strategies to help human operators understanding and performance when con- trolling swarms. These strategies can be thoroughly tested and can provide knowledge to be used in the future in a variety of scenarios. Behaviour trees are applied to represent human readable decision strategies which are produced through evolution. We investigate a simulated set of scenarios where a swarm of robots have to explore varying environments and reach sets of objectives. Effective supervisory control strategies are evolved to explore each environment using different local swarm behaviours. The evolved behaviour trees are animated alongside swarm simulations to enable clear under- standing of the supervisory strategies. We conclude by identifying the strengths in accelerated testing and the benefits of this approach for scenario exploration and training of human operators. Keywords: Human Swarm Interaction; Swarm; Artificial Evolution; Supervisory Control; Behaviour Trees 1. INTRODUCTION • Parametric: Adjusting the characteristics of an emer- gent behaviour [6, 12]. Growing interest in the use of swarm systems has led • Environmental: The operator highlights points of inter- to new questions regarding effective design for real-world est within an environment [8, 26].
    [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]
  • Application of the Firefly Algorithm for Solving the Economic Emissions
    Hindawi Publishing Corporation International Journal of Combinatorics Volume 2011, Article ID 523806, 23 pages doi:10.1155/2011/523806 Research Article Application of the Firefly Algorithm for Solving the Economic Emissions Load Dispatch Problem Theofanis Apostolopoulos and Aristidis Vlachos Department of Informatics, University of Piraeus, 80 Karaoli and Dimitriou Street, 18534 Piraeus, Greece Correspondence should be addressed to Aristidis Vlachos, [email protected] Received 30 August 2010; Accepted 14 November 2010 Academic Editor: Hajo Broersma Copyright q 2011 T. Apostolopoulos and A. Vlachos. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Efficient and reliable power production is necessary to meet both the profitability of power systems operations and the electricity demand, taking also into account the environmental concerns about the emissions produced by fossil-fuelled power plants. The economic emission load dispatch problem has been defined and applied in order to deal with the optimization of these two conflicting objectives, that is, the minimization of both fuel cost and emission of generating units. This paper introduces and describes a solution to this famous problem using a new metaheuristic nature-inspired algorithm, called firefly algorithm, which was developed by Dr. Xin-She Yang at Cambridge University in 2007. A general formulation of this algorithm is presented together with an analytical mathematical modeling to solve this problem by a single equivalent objective function. The results are compared with those obtained by alternative techniques proposed by the literature in order to show that it is capable of yielding good optimal solutions with proper selection of control parameters.
    [Show full text]
  • Firefly Algorithm Applied to Integer Programming Problems
    Recent Advances in Mathematics Firefly Algorithm Applied to Integer Programming Problems Nebojsa BACANIN, Ivona BRAJEVIC, Milan TUBA Faculty of Computer Science Megatrend University Belgrade Bulevar umetnosti 29, N. Belgrade SERBIA [email protected], [email protected], [email protected], Abstract: - Firefly algorithm is a recently added member of the swarm intelligence heuristics family. In this paper the firefly algorithm is adjusted and applied to integer programming problems. In order to deal with integer programming problems, firefly algorithm rounds the parameter values to the closest integer after producing new solutions. The performance of firefly algorithm is tested on seven problems widely used in the literature. Artificial bee colony algorithm is also implemented for comparison with the results of the firefly algorithm. Experimental results show that the firefly algorithm proved to be superior in almost all tested problems. Key-Words: - Firefly algorithm, Optimization metaheuristics, Integer programming, Swarm intelligence 1 Introduction Delaunay triangulation of the free configuration Linear programming optimization can find optimal space [3] are also solvable by integer programming solution to problems with hundreds of thousands of method. The entire class of problems referred to as constraints and variables. Modeling strength and sequencing, scheduling and routing is inherently solvability makes linear programming technique integer programs. This class of problems might for applicable in real life problems. Integer example deal with the scheduling of students and programming is a form of mathematical classrooms in such a way that the number of optimization program where some or all employed students who cannot take their first choice of classes variables are required to have integer values.
    [Show full text]
  • Title: a Memory-Integrated Artificial Bee Algorithm for Heuristic Optimisation
    Title: A memory-integrated artificial bee algorithm for heuristic optimisation Name: T. Bayraktar This is a digitised version of a dissertation submitted to the University of Bedfordshire. It is available to view only. This item is subject to copyright. A MEMORY-INTEGRATED ARTIFICIAL BEE ALGORITHM FOR HEURISTIC OPTIMISATION T. BAYRAKTAR MSc. by Research 2014 UNIVERSITY OF BEDFORDSHIRE 1 A MEMORY-INTEGRATED ARTIFICIAL BEE ALGORITHM FOR HEURISTIC OPTIMISATION by T. BAYRAKTAR A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirements for the degree of Master of Science by Research February 2014 2 A MEMORY-INTEGRATED ARTIFICIAL BEE ALGORITHM FOR HEURISTIC OPTIMISATION T. BAYRAKTAR ABSTRACT According to studies about bee swarms, they use special techniques for foraging and they are always able to find notified food sources with exact coordinates. In order to succeed in food source exploration, the information about food sources is transferred between employed bees and onlooker bees via waggle dance. In this study, bee colony behaviours are imitated for further search in one of the common real world problems. Traditional solution techniques from literature may not obtain sufficient results; therefore other techniques have become essential for food source exploration. In this study, artificial bee colony (ABC) algorithm is used as a base to fulfil this purpose. When employed and onlooker bees are searching for better food sources, they just memorize the current sources and if they find better one, they erase the all information about the previous best food source. In this case, worker bees may visit same food source repeatedly and this circumstance causes a hill climbing in search.
    [Show full text]
  • Comparison of Hybrid Firefly Algorithms for Power Allocation in a TV White Space Network
    International Journal of Computer Applications (0975 – 8887) Volume 178 – No. 38, August 2019 Comparison of Hybrid Firefly Algorithms for Power Allocation in a TV White Space Network Kennedy K. Ronoh George Kamucha Tonny K. Omwansa School of Computing and Department of Electrical and School of Computing and Informatics Information Engineering Informatics University of Nairobi University of Nairobi University of Nairobi Nairobi, Kenya Nairobi, Kenya Nairobi, Kenya ABSTRACT 1GHz spectrum. TV white spaces (TVWS) can be used by Secondary Users Regulatory authorities worldwide have mandated the use of (SUs) through Dynamic Spectrum Access (DSA) as long as geo-location database (GLDB) for protection of incumbent they do not cause harmful interference to Primary Users users in TVWS network. GLDB is used by a SU or White (PUs). Due spectrum scarcity, there is increasing demand for Space Device (WSD) to find the set of frequency channels DSA. When there is a high density of SUs in a TVWS that can be used on a secondary basis at a given area and at network such as cellular access to TVWS, problem of any given time [5], [6], [7]. GLDB is populated through the interference among SUs will arise. Possibility of harmful use of a propagation model. The database contains estimated interference to PUs may also arise. Optimization of power power levels of PUs for any point in a particular region of allocation is therefore necessary to reduce the level of interest. The WSD, which has a Cognitive Radio System interference among SUs and to protect PUs against harmful (CRS), queries a central database.
    [Show full text]
  • Mobility and Infectiousness in the Spatial Spread of an Emerging Fungal Pathogen
    Received: 7 May 2020 | Accepted: 11 January 2021 DOI: 10.1111/1365-2656.13439 RESEARCH ARTICLE Mobility and infectiousness in the spatial spread of an emerging fungal pathogen Kate E. Langwig1 | J. Paul White2 | Katy L. Parise3 | Heather M. Kaarakka2 | Jennifer A. Redell2 | John E. DePue4 | William H. Scullon5 | Jeffrey T. Foster3 | A. Marm Kilpatrick6 | Joseph R. Hoyt1 1Department of Biological Sciences, Virginia Polytechnic Institute, Blacksburg, VA, USA; 2Wisconsin Department of Natural Resources, Madison, WI, USA; 3Pathogen and Microbiome Institute, Northern Arizona University, Flagstaff, AZ, USA; 4Michigan Department of Natural Resources, Baraga, MI, USA; 5Michigan Department of Natural Resources, Norway, MI, USA and 6Department of Ecology and Evolutionary Biology, University of California, Santa Cruz, CA, USA Correspondence Kate E. Langwig Abstract Email: [email protected] 1. Emerging infectious diseases can have devastating effects on host communities, caus- Funding information ing population collapse and species extinctions. The timing of novel pathogen arrival National Science Foundation, Grant/Award into naïve species communities can have consequential effects that shape the trajec- Number: DEB- 1115895, DEB- 1336290 and DEB- 1911853; U.S. Fish and Wildlife tory of epidemics through populations. Pathogen introductions are often presumed Service, Grant/Award Number: F17AP00591 to occur when hosts are highly mobile. However, spread patterns can be influenced Handling Editor: Isabella Cattadori by a multitude of other factors including host body condition and infectiousness. 2. White- nose syndrome (WNS) is a seasonal emerging infectious disease of bats, which is caused by the fungal pathogen Pseudogymnoascus destructans. Within- site transmission of P. destructans primarily occurs over winter; however, the influence of bat mobility and infectiousness on the seasonal timing of pathogen spread to new populations is unknown.
    [Show full text]
  • An Improved Bees Algorithm for Training Deep Recurrent Networks for Sentiment Classification
    S S symmetry Article An Improved Bees Algorithm for Training Deep Recurrent Networks for Sentiment Classification Sultan Zeybek 1,* , Duc Truong Pham 2, Ebubekir Koç 3 and Aydın Seçer 4 1 Department of Computer Engineering, Fatih Sultan Mehmet Vakif University, Istanbul 34445, Turkey 2 Department of Mechanical Engineering, University of Birmingham, Birmingham B15 2TT, UK; [email protected] 3 Department of Biomedical Engineering, Fatih Sultan Mehmet Vakif University, Istanbul 34445, Turkey; [email protected] 4 Department of Mathematical Engineering, Yildiz Technical University, Istanbul 34220, Turkey; [email protected] * Correspondence: [email protected] Abstract: Recurrent neural networks (RNNs) are powerful tools for learning information from temporal sequences. Designing an optimum deep RNN is difficult due to configuration and training issues, such as vanishing and exploding gradients. In this paper, a novel metaheuristic optimisation approach is proposed for training deep RNNs for the sentiment classification task. The approach employs an enhanced Ternary Bees Algorithm (BA-3+), which operates for large dataset classification problems by considering only three individual solutions in each iteration. BA-3+ combines the collaborative search of three bees to find the optimal set of trainable parameters of the proposed deep recurrent learning architecture. Local learning with exploitative search utilises the greedy selection strategy. Stochastic gradient descent (SGD) learning with singular value decomposition (SVD) aims to Citation: Zeybek, S.; Pham, D. T.; handle vanishing and exploding gradients of the decision parameters with the stabilisation strategy Koç, E.; Seçer, A. An Improved Bees of SVD. Global learning with explorative search achieves faster convergence without getting trapped Algorithm for Training Deep at local optima to find the optimal set of trainable parameters of the proposed deep recurrent learning Recurrent Networks for Sentiment architecture.
    [Show full text]
  • Synchronization of Fireflies Can Improve Or Inspire Robotic Swarm
    elligenc International Journal of Swarm nt e I an rm d a E w v S o f l u o t l i o a n n a r u r Intelligence and Evolutionary y o C J l o a m n p ISSN:o 2090-4908 i t u a t a n t r i o e t n I n Computation Editorial Synchronization of Fireflies can Improve or Inspire Robotic Swarm Seelu Palai* Department of Computer Science, Parul University, Limda, Waghodia, Gujarat DESCRIPTION issue within the scientific community, many researchers believe Despite their simple brains, synchronized fireflies have that it helps fireflies for locating mates, protecting themselves something to show us about AI. A recent discovery on the from their predators and attracting their potential prey. within insect's amazing light shows could help researchers acquire fresh the firefly algorithm, the target function of a given optimization insight into swarm robotics. It seems, the synchronized fireflies' problem is related to this flashing light or candlepower which light displays are even more subtle than scientists realized, and helps the swarm of fireflies to maneuver to brighter and more it's to try to with the insect's three-dimensional positioning. They attractive locations so as to get efficient optimal solutions. found that fireflies behave differently after they are alone versus Multiple conflicting objectives arise naturally in most real-world in groups. In seems, synchronized fireflies what their neighbors combinatorial optimization problems. Several principles and do, rather than blinking consistent with any inherent rhythm. methods are developed and proposed for over a decade so as to Then they modify their blinking pattern to match those around resolve problems.
    [Show full text]