Artificial Bee Colony Algorithm

Slides:



Advertisements
Similar presentations
Computational Intelligence Winter Term 2011/12 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Advertisements

Artificial Bee Colony Algorithm
Artificiel Bee Colony (ABC) Algorithme Isfahan University of Technology Fall Elham Seifossadat Faegheh Javadi.
Computational Intelligence Winter Term 2013/14 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Comparing Effectiveness of Bioinspired Approaches to Search and Rescue Scenarios Emily Shaeffer and Shena Cao 4/28/2011Shaeffer and Cao- ESE 313.
PARTICLE SWARM OPTIMISATION (PSO) Perry Brown Alexander Mathews Image:
Ant colonies for the traveling salesman problem Eliran Natan Seminar in Bioinformatics (236818) – Spring 2013 Computer Science Department Technion - Israel.
Artificial Bee Colony Algorithm
Biologically Inspired Computation Lecture 10: Ant Colony Optimisation.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
Ant Colonies As Logistic Processes Optimizers
MAE 552 – Heuristic Optimization Lecture 10 February 13, 2002.
Algorithms For Inverse Reinforcement Learning Presented by Alp Sardağ.
A rtificial B ee C olony. Dancing aea for A Dancing area for B Unloading nectar from A Unloading nectar from B ES EF OB SB RF ER OB ER ES RF EF Behaviour.
Radial Basis Function Networks
Ant Colony Optimization: an introduction
Ant Colony Optimization (ACO): Applications to Scheduling
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Distributed Systems 15. Multiagent systems and swarms Simon Razniewski Faculty of Computer Science Free University of Bozen-Bolzano A.Y. 2014/2015.
 C. C. Hung, H. Ijaz, E. Jung, and B.-C. Kuo # School of Computing and Software Engineering Southern Polytechnic State University, Marietta, Georgia USA.
PROJECT LM-01 Presentation 16 Oct 2006 University of Wollongong, Australia.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
CSM6120 Introduction to Intelligent Systems Other evolutionary algorithms.
Parallel LTL Model Checking CS 586. The Capacity Problem Capacity = memory states*stateSize Increase capacity by - Increasing memory - Decreasing states.
Swarm Computing Applications in Software Engineering By Chaitanya.
Swarm Intelligence 虞台文.
DRILL Answer the following question’s in your notebook: 1.How does ACO differ from PSO? 2.What does positive feedback do in a swarm? 3.What does negative.
1 IE 607 Heuristic Optimization Particle Swarm Optimization.
Neural and Evolutionary Computing - Lecture 11 1 Nature inspired metaheuristics  Metaheuristics  Swarm Intelligence  Ant Colony Optimization  Particle.
Particle Swarm Optimization Speaker: Lin, Wei-Kai
1 S ystems Analysis Laboratory Helsinki University of Technology Flight Time Allocation Using Reinforcement Learning Ville Mattila and Kai Virtanen Systems.
A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti.
Artificial intelligence methods in the CO 2 permission market simulation Jarosław Stańczak *, Piotr Pałka **, Zbigniew Nahorski * * Systems Research Institute,
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
7 th International Conference on Numerical Methods and Applications, August 20-24, 2010, Borovets, Bulgaria Ant Colony Optimization Approach to Tokens‘
Tetris Agent Optimization Using Harmony Search Algorithm
DRILL Answer the following question’s in your notebook: 1.How does ACO differ from PSO? 2.What does positive feedback do in a swarm? 3.What does negative.
The Ant System Optimization by a colony of cooperating agents.
Biologically Inspired Computation Ant Colony Optimisation.
Parallelization of a Swarm Intelligence System
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
DRILL Answer the following question’s about yesterday’s activity in your notebook: 1.Was the activity an example of ACO or PSO? 2.What was the positive.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Topic1:Swarm Intelligence 李长河,计算机学院
Done by Fazlun Satya Saradhi. INTRODUCTION The main concept is to use different types of agent models which would help create a better dynamic and adaptive.
4/22/20031/28. 4/22/20031/28 Presentation Outline  Multiple Agents – An Introduction  How to build an ant robot  Self-Organization of Multiple Agents.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Introduction to Machine Learning, its potential usage in network area,
OPERATING SYSTEMS CS 3502 Fall 2017
Scientific Research Group in Egypt (SRGE)
Discrete ABC Based on Similarity for GCP
Scientific Research Group in Egypt (SRGE)
School of Computer Science & Engineering
Reinforcement Learning (1)
B. Jayalakshmi and Alok Singh 2015
CONSTRAINED NON-STATIONARY STATE FEEDBACK SPEED CONTROL OF PMSM
Informed Search and Exploration
Advanced Artificial Intelligence Evolutionary Search Algorithm
Firat Tekiner (Phd Student) Z. Ghassemlooy
Computational Intelligence
Social Learning: The Importance of Copying Others
فهرست مطالب 1- الگوریتم کلونی زنبورعسل مصنوعی
CPU SCHEDULING.
Overview of SWARM INTELLIGENCE and ANT COLONY OPTIMIZATION
Ant Colony Optimization
traveling salesman problem
Boltzmann Machine (BM) (§6.4)
Computational Intelligence
Evolutionary Computational Intelligence
Presentation transcript:

Artificial Bee Colony Algorithm Adnan ACAN

Introduction Term swarm in general refer to a collection of interacting agents or individuals. Two fundamental concepts in swarn systems are self-organization and division of labour, that are necessary and sufficient properties to obtain swarm intelligent behaviour

Self-organization : can be defined as a set of dynamical mechanisms that establish basic rules for interactions between the components of the system. The rules ensure that the interactions are executed on the basis of purely local information without any relation to the global pattern.

Division of Labor: In swarm behavior different tasks are performed simultaneously by specialized individuals which is referred to as division of labor. It enables swarm to respond to changed conditions in the search space.

Behavior of Honey Bee Swarm Three essential components of forage selection: Food Sources: The value of a food source depends on many factors such as its proximity to the nest, its richness or concentration of its energy, and the ease of extracting this energy. Employed Foragers: They are associated with a particular food source which they are currently exploiting or are “employed” at. They carry with them information about this particular source, its distance and direction from the nest, the profitability of the source and share this information with a certain probability.

The model defines two leading modes of the behavior: Unemployed Foragers: They are continually at look out for a food source to exploit. There are two types of unemployed foragers: scouts, searching the environment surrounding the nest for new food sources and onlookers waiting in the nest and establishing a food source through the information shared by employed foragers. The model defines two leading modes of the behavior: recruitment to a nectar source the abandonment of a source.

Exchange of Information among bees The exchange of information among bees is the most important occurrence in the formation of collective knowledge. The most important part of the hive with respect to exchanging information is the dancing area Communication among bees related to the quality of food sources takes place in the dancing area. This dance is called a Waggle dance.

Employed foragers share their information with a probability proportional to the profitability of the food source, and the sharing of this information through waggle dancing is longer in duration. An onlooker on the dance floor, probably she can watch numerous dances and decides to employ herself at the most profitable source. There is a greater probability of onlookers choosing more profitable sources since more information is circulated about the more profitable sources.

Basic Self Organization Properties Positive feedback: As the nectar amount of food sources increases, the number of onlookers visiting them increases, too. Negative feedback: The exploitation process of poor food sources is stopped by bees. Fluctuations: The scouts carry out a random search process for discovering new food sources. Multiple interactions: Bees share their information about food sources with their nest mates on the dance area.

Artificial Bee Colony Algortihm Simulates behavior of real bees for solving multidimensional and multimodal optimisation problems. The colony of artificial bees consists of three groups of bees: employed bees, onlookers and scouts. The first half of the colony consists of the employed artificial bees and the second half includes the onlookers. The number of employed bees is equal to the number of food sources around the hive. The employed bee whose food source has been exhausted by the bees becomes a scout.

ABC Algorithm

Explanation Each cycle of search consists of three steps: moving the employed and onlooker bees onto the food sources and calculating their nectar amounts; and determining the scout bees and directing them onto possible food sources. A food source position represents a possible solution to the problem to be optimized. The amount of nectar of a food source corresponds to the quality of the solution Onlookers are placed on the food sources by using a probability based selection process.

As the nectar amount of a food source increases, the probability value with which the food source is preferred by onlookers increases, too. The scouts are characterized by low search costs and a low average in food source quality. One bee is selected as the scout bee. The selection is controlled by a control parameter called "limit". If a solution representing a food source is not improved by a predetermined number of trials, then that food source is abandoned and the employed bee is converted to a scout.

Control Parameters of ABC Algorithm swarmsize Limit number of onlookers: 50% of the swarm number of employed bees: 50% of the swarm number of scouts: 1

Exploration vs Exploitation Onlookers and employed bees carry out the exploitation process in the search space Scouts control the exploration process

Matlab Implementation

The formula for producing a candidate solution from the existing is described below: where i,k: {1,2,….. Number of Employed Bees} j: {1,2,….D} are randomly chosen index D: Number of parameters to optimize k<> i : is randomly chosen φi,j: random number [-1,+1]

After each candidate source position vi,j is produced and then evaluated by the artificial bee, its performance is compared with that of xi,j. If the new food has equal or better nectar than the old source, it is replaced with the old one in the memory. Otherwise, the old one is retained. In other words, a greedy selection mechanism is employed as the selection operation between the old and the current food sources. An onlooker bee chooses a food source depending on the probability value associatedwith that food source, pi, calculated by:

The trial parameter is defined for those solutions that are exhausted and not changing. This function determines those food sources and abandons them

Conclusion ABC algorithm in fact employs four different selection processes: A global selection process used by the artificial onlooker bees for discovering promising regions as A local selection process carried out in a region by the artificial employed bees and the onlookers depending on local information A local selection process called greedy selection process carried out by all bees in that if the nectar amount of the candidate source is better than that of the present one, thebee forgets the present one and memorizes the candidate source. Otherwise the bee keeps the present one in the memory. A random selection process carried out by scouts.

References [1] D. Karaboga , B. Basturk “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm, J Glob Optim (2007) 39:459–471 [2] D.Karaboga “An idea based on honey bee swarm for numerical optimization” TR-06, October 2005