The document describes the Bees Algorithm, which is an optimization algorithm inspired by the foraging behavior of honey bees. It begins with randomly placed scout bees that evaluate potential solutions. The best sites are selected and more bees are recruited to explore near those locations. The fittest bees are kept and the process repeats until termination criteria is met. The algorithm aims to efficiently locate good solutions like honey bees locating food sources. It can be applied to problems with multiple optimal solutions.
The cuckoo search algorithm is a recently developed meta-heuristic optimization algorithm, which is suitable for solving optimization problems. Cuckoo search is a nature-inspired metaheuristic algorithm, based on the brood parasitism of some cuckoo species, along with Levy flights random walks
Swarm intelligence is a modern artificial intelligence discipline that is concerned with the design of multiagent systems with applications, e.g., in optimization and in robotics. The design paradigm for these systems is fundamentally different from more traditional approaches.
محاضرات متقدمة تدرس لطلاب حاسبات بنى سويف السنة الثالثة لتنمية قدراتهم البحثية وهذة الموضوعات تدرس على مستوى الدكتوراة - - نريد تميز طلاب حاسبات ليتميزو فى البحث العلمى -
This presentation provides an introduction to the Ant Colony Optimization topic, it shows the basic idea of ACO, advantages, limitations and the related applications.
Artificial Bee Colony (ABC) algorithm is a Nature
Inspired Algorithm (NIA) which based on intelligent food
foraging behaviour of honey bee swarm. This paper introduces
a local search strategy that enhances exploration competence
of ABC and avoids the problem of stagnation. The proposed
strategy introduces two new local search phases in original
ABC. One just after onlooker bee phase and one after scout
bee phase. The newly introduced phases are inspired by
modified Golden Section Search (GSS) strategy. The proposed
strategy named as new local search strategy in ABC
(NLSSABC). The proposed NLSSABC algorithm applied over
thirteen standard benchmark functions in order to prove its
efficiency.
The cuckoo search algorithm is a recently developed meta-heuristic optimization algorithm, which is suitable for solving optimization problems. Cuckoo search is a nature-inspired metaheuristic algorithm, based on the brood parasitism of some cuckoo species, along with Levy flights random walks
Swarm intelligence is a modern artificial intelligence discipline that is concerned with the design of multiagent systems with applications, e.g., in optimization and in robotics. The design paradigm for these systems is fundamentally different from more traditional approaches.
محاضرات متقدمة تدرس لطلاب حاسبات بنى سويف السنة الثالثة لتنمية قدراتهم البحثية وهذة الموضوعات تدرس على مستوى الدكتوراة - - نريد تميز طلاب حاسبات ليتميزو فى البحث العلمى -
This presentation provides an introduction to the Ant Colony Optimization topic, it shows the basic idea of ACO, advantages, limitations and the related applications.
Artificial Bee Colony (ABC) algorithm is a Nature
Inspired Algorithm (NIA) which based on intelligent food
foraging behaviour of honey bee swarm. This paper introduces
a local search strategy that enhances exploration competence
of ABC and avoids the problem of stagnation. The proposed
strategy introduces two new local search phases in original
ABC. One just after onlooker bee phase and one after scout
bee phase. The newly introduced phases are inspired by
modified Golden Section Search (GSS) strategy. The proposed
strategy named as new local search strategy in ABC
(NLSSABC). The proposed NLSSABC algorithm applied over
thirteen standard benchmark functions in order to prove its
efficiency.
We try to solve the Vehicle Routing Problem by using the Artificial Bee Colony (ABC) algorithm--an optimisation algorithm that mimics the swarm intelligence of bees in nature. We implement this algorithm in parallel over several cores and present a comparative study of the results.
A Modified Bee Colony Optimization Algorithm for Nurse Rostering ProblemAM Publications
Scheduling shifts to the nurses in the hospital is highly a complex problem. The Nurse Scheduling
Problem (NRP) is considered to be a NP-Hard. It can be solved by combinatorial optimization problem. This paper
proposes a modified BCO algorithm for solving the problem. The modified Bee Colony Optimization algorithm
modifies the forward pass phases by introducing a pipelined constructive move followed by local search and
discarding move for solving Nurse Rostering Problem.
Networks community detection using artificial bee colony swarm optimizationAboul Ella Hassanien
Community structure identification in complex networks has been an important research topic in recent years. Community detection can be viewed as an optimization problem in which an objective quality function that captures the intuition of a community as a group of nodes with better internal connectivity than external connectivity is chosen to be optimized. In this work Artificial bee
colony (ABC) optimization has been used as an effective optimization technique to solve the community detection problem with the advantage that the number of
communities is automatically determined in the process. However, the algorithm performance is influenced directly by the quality function used in the optimization
process. A comparison is conducted between different popular communities’ quality measures when used as an objective function within ABC. Experiments on real life networks show the capability of the ABC to successfully find an optimized community structure based on the quality function used.
This is the first slide show for the beginning beekeeping class for back yard beekeepers for the Cape Girardeau Career and Technology Center, taught by Jackson, Missouri, beekeeper Grant Gillard. Like any new hobby, keeping honey bees and establishing an apiary can be a little intimidating. Bees sting and it hurts! Bees are still dying and this is still a very challenging time to get started. It's also kind of expensive to buy honey bee equipment, whether new or used.
کدنویسی الگوریتم کلونی مصنوعی زنبور عسل یا الگوریتم ABC در متلب کتابخانه خانه متلب
matlabhome.ir matlab_net@yahoo.com 09190090258
الگوریتم کلونی مصنوعی زنبورعسل یا الگوریتم ABC
بر اساس هوش ازدحامی و نحوه زندگی زنبورهای عسل ایجاد گردیده است. با استفاده از شیوه زندگی زنبورعسل و مراحل جستجوی زنبور عسل برای غذا می توان به بهینه سازی مدل های پیچیده و مدل هایی که در اصطلاح در کلاس Np-Hrad قرار می گیرند ، پرداخت. با استفاده از الگوریتم ABC می توان مدل هایی با محدودیت های زیاد و سنگین و همچنین مدل هایی که با روش های قطعی قابل حل نیستند را مورد حل قرار داد.
در الگوریتم کلونی مصنوعی زنبور عسل یا الگوریتم ABC سه دسته زنبور مورد بررسی قرار می گیرند.
زنبورهای کارگر ، زنبورهای تماشاچی و زنبورهای پیش آهنگ.
برای حل مدل های مختلف با این الگوریتم می توانید اینجا کلیک نمایید.
در الگوریتم کلونی مصنوعی زنبور عسل ، محل هر غذا یک جواب در نظر گرفته می شود. در مرحله اول تعدادی محل غذا به طور تصادفی در نظر گرفته می شود و زنبورها به سراغ آن محل ها می روند و پس از بررسی شهد موجود در غذا به کندو برگشته و تبادل اطلاعات می نمایند . این تبادل اطلاعات در محلی به نام محل رقص صورت می گیرد و دیگر زنبورهای تماشاچی می توانند محل غذای مورد نظر را انتخاب نموده و به سراغ آن بروند.
الگوریتم ABC
الگوریتم ABC
سپس هر زنبور کارگر به محل غذایی قبلی رفته و با توجه به اطلاعات موجود در حافظه اش محل غذایی جدیدی را در همسایگی پیدا می گردد.
در محل رقص هر زنبور کارگر محل غذایی با شهد بالاتر را یافته باشد ، احتمال اینکه این محل توسط زنبورهای تماشاچی انتخاب شود ، بیشتر می باشد.
همچنین اگر محل غذایی ترک شود ، زنبورهای پیش آهنگ یک محل غذایی جدید پیدا می کنند.
با توجه به اصول هوش ازدحامی ، زنبورها در نهایت به محل غذایی ( جوابی) با بهترین مقدار پی ش می روند و این کار باعث یافتن جوابی مناسب برای مسئله مورد نظر می شود.
Early Humans relied on Hunting wild animals and gathering vegetables and fruits, and in the course of their hunter-gatherer lifestyle they would have come across honey in bees’ nests high in the trees.
These slides are from Robert "Bob" Borkowski's "Beekeeping 101" workshop, presented through the Institute of Applied Agriculture at the University of Maryland, College Park.
Artificial bee colony (ABC) algorithm has proved its importance in solving a number of problems including engineering optimization problems. ABC algorithm is one of the most popular and youngest member of the family of population based nature inspired meta-heuristic swarm intelligence method. ABC has been proved its superiority over some other Nature Inspired Algorithms (NIA) when applied for both benchmark functions and real world problems. The performance of search process of ABC depends on a random value which tries to balance exploration and exploitation phase. In order to increase the performance it is required to balance the exploration of search space and exploitation of optimal solution of the ABC. This paper outlines a new hybrid of ABC algorithm with Genetic Algorithm. The proposed method integrates crossover operation from Genetic Algorithm (GA) with original ABC algorithm. The proposed method is named as Crossover based ABC (CbABC). The CbABC strengthens the exploitation phase of ABC as crossover enhances exploration of search space. The CbABC tested over four standard benchmark functions and a popular continuous optimization problem.
SWARM INTELLIGENCE FROM NATURAL TO ARTIFICIAL SYSTEMS: ANT COLONY OPTIMIZATIONFransiskeran
Successful applications coming from biologically inspired algorithm like Ant Colony Optimization (ACO)
based on artificial swarm intelligence which is inspired by the collective behavior of social insects. ACO
has been inspired from natural ants system, their behavior, team coordination, synchronization for the
searching of optimal solution and also maintains information of each ant. At present, ACO has emerged as
a leading metaheuristic technique for the solution of combinatorial optimization problems which can be
used to find shortest path through construction graph. This paper describe about various behavior of ants,
successfully used ACO algorithms, applications and current trends. In recent years, some researchers
have also focused on the application of ACO algorithms to design of wireless communication network,
bioinformatics problem, dynamic problem and multi-objective problem.
Can machines understand the scientific literaturepetermurrayrust
With over 5000 scientific articles per day we need machines to help us understand the content. This material is to be used at an interactive session for the Science Society at Trinity College Cambridge UK
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Reliable and accurate estimation of software has always been a matter of concern for industry and
academia. Numerous estimation models have been proposed by researchers, but no model is suitable for all
types of datasets and environments. Since the motive of estimation model is to minimize the gap between
actual and estimated effort, the effort estimation process can be viewed as an optimization problem to tune
the parameters. In this paper, evolutionary computing techniques, including, Bee colony optimization,
Particle swarm optimization and Ant colony optimization have been employed to tune the parameters of
COCOMO Model. The performance of these techniques has been analysed by established performance
measure. The results obtained have been validated by using data of Interactive voice response (IVR)
projects. Evolutionary techniques have been found to be more accurate than existing estimation models.
EVOLUTIONARY COMPUTING TECHNIQUES FOR SOFTWARE EFFORT ESTIMATIONijcsit
Reliable and accurate estimation of software has always been a matter of concern for industry and academia. Numerous estimation models have been proposed by researchers, but no model is suitable for all types of datasets and environments. Since the motive of estimation model is to minimize the gap between actual and estimated effort, the effort estimation process can be viewed as an optimization problem to tune
the parameters. In this paper, evolutionary computing techniques, including, Bee colony optimization, Particle swarm optimization and Ant colony optimization have been employed to tune the parameters of COCOMO Model. The performance of these techniques has been analysed by established performance measure. The results obtained have been validated by using data of Interactive voice response (IVR)
projects. Evolutionary techniques have been found to be more accurate than existing estimation models.
Reliable and accurate estimation of software has always been a matter of concern for industry and academia. Numerous estimation models have been proposed by researchers, but no model is suitable for all types of datasets and environments. Since the motive of estimation model is to minimize the gap between actual and estimated effort, the effort estimation process can be viewed as an optimization problem to tune the parameters. In this paper, evolutionary computing techniques, including, Bee colony optimization, Particle swarm optimization and Ant colony optimization have been employed to tune the parameters of COCOMO Model. The performance of these techniques has been analysed by established performance measure. The results obtained have been validated by using data of Interactive voice response (IVR) projects. Evolutionary techniques have been found to be more accurate than existing estimation models.
Swarm Intelligence: An Application of Ant Colony OptimizationIJMER
Swarm intelligence, a branch of artificial intelligence is a part which discusses the collective
behaviour of social animals such as ants, fishes, termites, birds, bacteria. The collective behaviour of
animals to achieve target can be used in practical applications. One of the applications is ant colony
optimization. Ongoing research of ACO, there are diverse applications namely data mining, image
processing, power electronic circuit design etc. One of that is network routing. By using ACO, we can
find the shortest path in network routing
Artificial Bee Colony (ABC) optimization
algorithm is one of the recent population based probabilistic
approach developed for global optimization. ABC is simple
and has been showed significant improvement over other
Nature Inspired Algorithms (NIAs) when tested over some
standard benchmark functions and for some complex real
world optimization problems. Memetic Algorithms also
become one of the key methodologies to solve the very large
and complex real-world optimization problems. The solution
search equation of Memetic ABC is based on Golden Section
Search and an arbitrary value which tries to balance
exploration and exploitation of search space. But still there
are some chances to skip the exact solution due to its step
size. In order to balance between diversification and
intensification capability of the Memetic ABC, it is
randomized the step size in Memetic ABC. The proposed
algorithm is named as Randomized Memetic ABC (RMABC).
In RMABC, new solutions are generated nearby the best so
far solution and it helps to increase the exploitation capability
of Memetic ABC. The experiments on some test problems of
different complexities and one well known engineering
optimization application show that the proposed algorithm
outperforms over Memetic ABC (MeABC) and some other
variant of ABC algorithm(like Gbest guided ABC
(GABC),Hooke Jeeves ABC (HJABC), Best-So-Far ABC
(BSFABC) and Modified ABC (MABC) in case of almost all
the problems.
The first ant colony optimization (ACO) called ant system was inspired through studying of the behaviour of ants in 1991 by Macro Dorigo and co-workers. An ant colony is highly organized, in which one interacting with others through pheromone in perfect harmony. Optimization problems can be solved through simulating ant’s behaviours. Since the first ant system algorithm was proposed, there is a lot of development in ACO. In ant colony system algorithm, local pheromone is used for ants to search optimum result. However, high magnitude of computing is its deficiency and sometimes it is inefficient. Thomas Stützle etal. Introduced MAX-MIN Ant System (MMAS) in 2000. It is one of the best algorithms of ACO. It limits total pheromone in every trip or sub-union to avoid local convergence. However, the limitation of pheromone slows down convergence rate in MMAS.
AUTOMATED TEST CASE GENERATION AND OPTIMIZATION: A COMPARATIVE REVIEWijcsit
Software testing is the primary phase, which is performed during software development and it is carried by a sequence of instructions of test inputs followed by expected output. Evolutionary algorithms are most popular in the computational field based on population. The test case generation process is used to identify
test cases with resources and also identifies critical domain requirements. The behavior of bees is based on
population and evolutionary method. Bee Colony algorithm (BCA) has gained superiority in comparison to other algorithms in the field of computation. The Harmony Search (HS) algorithm is based on the enhancement process of music. When musicians compose the harmony through different possible combinations of the music, at that time the pitches are stored in the harmony memory and the optimization
can be done by adjusting the input pitches and generate the perfect harmony. Particle Swarm Optimization (PSO) is an intelligence based meta-heuristic algorithm where each particle can locate their source of food at different position.. In this algorithm, the particles will search for a better food source position in the hope of getting a better result. In this paper, the role of Artificial Bee Colony, particle swarm optimization
and harmony search algorithms are analyzed in generating random test data and optimized those test data.
Test case generation and optimization through bee colony, PSO and harmony search (HS) algorithms which are applied through a case study, i.e., withdrawal operation in Bank ATM and it is observed that these algorithms are able to generate suitable automated test cases or test data in a client manner. This
section further gives the brief details and compares between HS, PSO, and Bee Colony (BC) Optimization
methods which are used for test case or test data generation and optimization.
Ant Colony System with Saving Heuristic for Capacitated Vehicle Routing Problemijtsrd
The ACO heuristics is a distributed and cooperative search method that imitates the behavior of real ants in its the search for food. The Capacitated Vehicle Routing Problem CVRP is a well known combinatorial optimization problem, which is concerned with the distribution of goods between the depot and customers. This paper will apply the Ant Colony System ACS with Savings heuristic algorithm to solve Capacitated Vehicle Routing Problem. This problem will be solve to determine an optimal distribution plan that meets all the demands at minimum total cost by applying the ACS algorithm. In this paper, we consider that there is a single depot or distribution center that caters to the customer demands at a set of sales points or demand centers using vehicles with known limited capacities. The demand at each of these demand centers is assumed to be constant and known. Due to its limited capacity, the vehicles may need to make several trips from the depot for replenishment. This system will implement the transportation cost of CVRP and can find the minimum cost routes between the depot and the customers by using the Benchmarks datasets. Aye Aye Chaw "Ant Colony System with Saving Heuristic for Capacitated Vehicle Routing Problem" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd27884.pdfPaper URL: https://www.ijtsrd.com/computer-science/artificial-intelligence/27884/ant-colony-system-with-saving-heuristic-for-capacitated-vehicle-routing-problem/aye-aye-chaw
HYBRID DATA CLUSTERING APPROACH USING K-MEANS AND FLOWER POLLINATION ALGORITHMaciijournal
Data clustering is a technique for clustering set of objects into known number of groups. Several approaches are widely applied to data clustering so that objects within the clusters are similar and objects in different clusters are far away from each other. K-Means, is one of the familiar center based clustering algorithms since implementation is very easy and fast convergence. However, K-Means algorithm suffers from initialization, hence trapped in local optima. Flower Pollination Algorithm (FPA) is the global optimization technique, which avoids trapping in local optimum solution. In this paper, a novel hybrid data clustering approach using Flower Pollination Algorithm and K-Means (FPAKM) is proposed. The proposed algorithm results are compared with K-Means and FPA on eight datasets. From the experimental results, FPAKM is better than FPA and K-Means.
HYBRID DATA CLUSTERING APPROACH USING K-MEANS AND FLOWER POLLINATION ALGORITHM
Bees algorithm
1. The Bees Algorithm, and Its
Applications
Dr. Ziad Salem, HDD, PhD, BsC.
Spezs1@hotmail.com
Computer Engineering Department
Electrical and Electronic Engineering Faculty
Aleppo University, Aleppo, Syrian Arab Republic
1
Masaryk University, Brno, Czech Republic , Wed
2. Outlines
Introduction
Intelligent Swarm –based optimisation
The Bees Algorithm
Bees in Nature
Proposed Bees Algorithm
Simple Example
BA Applications
Applications to Data mining
Conclusion 2
Masaryk University, Brno, Czech Republic , Wed
3. Introduction
There was a great interest between
researchers to generate search algorithms
that find near-optimal solutions in reasonable
running time
The Swarm-based Algorithm is a search
algorithm capable of locating good solutions
efficiently
The algorithm could be considered as
belonging to the category of “Intelligent
Optimisation Tools”
3
Masaryk University, Brno, Czech Republic , Wed
4. Swarm-based Optimisation Algorithm
SOAs mince nature’s methods to derive a
search towards the optimal solution
The key difference between SOAs and direct
search algorithms such as Hill Climbing is
that SOAs use a population of solutions for
every iteration instead of a single solution
As a population of solutions is processed in
an iteration, the outcome of each iteration is
also a population of solutions
4
Masaryk University, Brno, Czech Republic , Wed
5. Hill Climbing
Is a mathematical optimization technique
which belongs to the family of local search
It can be used to solve problems that have
many solutions, some of which are better
than others
It starts with a random (potentially poor) solution,
and iteratively makes small changes to the
solution, each time improving it a little. When the
algorithm cannot see any improvement anymore,
it terminates. Ideally, at that point the current
solution is close to optimal, but it is not
guaranteed that hill climbing will ever come close
to the optimal solution 5
Masaryk University, Brno, Czech Republic , Wed
6. Hill Climbing
It can be applied to the traveling Salesman
Problem. It is easy to find a solution that
visits all the cities but will be very poor
compared to the optimal solution
Hill climbing is used widely in AI, for reaching
a goal state from a starting node.
6
Masaryk University, Brno, Czech Republic , Wed
7. Swarm-based Optimisation Algorithm
If an optimisation problem has a single
optimum,
SOA population members can be
expected to join to that optimum solution
If an optimisation problem has multiple
optimal solutions,
SOA can be used to capture them in its
final populations
7
Masaryk University, Brno, Czech Republic , Wed
8. Swarm-based Optimisation Algorithm
SOAs include:
The Ant Colony Optimisation (ACO)
algorithm
The Genetic Algorithm (GA)
The Particle Swarm Optimisation (PSO)
algorithm
Others……(Bees Algorithm (BA))
8
Masaryk University, Brno, Czech Republic , Wed
9. Ant Colony Optimisation (ACO)
ACO is a very successful algorithm which
emulates the behaviour of real ants
Ants are capable of finding the shortest path
from the food source to their nest using a
chemical substance called pheromone to
guide their search
A passing lost ant will follow this trail
depends on the quality of the pheromone laid
on the ground as the ants move
9
Masaryk University, Brno, Czech Republic , Wed
10. Particle Swarm Optimisation (PSO)
PSO is an optimisation procedure based on
the social behaviour of groups of
organisations (for example the flocking of
birds and the schooling of fish)
Individual solutions in a population are
viewed as “particles” that evolve or change
their positions with time
Each particle modifies its position in search
space according to its own experience and
also that of a neighbouring particle by
remembering that best position visited by
itself and its neighbours (combining local and
global search methods)
10
Masaryk University, Brno, Czech Republic , Wed
11. Genetic Algorithm (GA)
GA is based on natural selection and genetic
recombination
GA works by choosing solutions from the
current population and then apply genetic
operators (such as mutation and crossover)
to create a new population
GA exploits historical information to speculate
on new search areas with improved
performance
GA advantage: It performs global search
11
Masaryk University, Brno, Czech Republic , Wed
12. SOAs Applications
SOA techniques can be used in a number of
applications
The U.S. military is investigating swarm
techniques for controlling vehicles
The European Space Agency is thinking about
an orbital swarm for self assembly
NASA is investigating the use of swarm
technology for planetary mapping
12
Masaryk University, Brno, Czech Republic , Wed
13. Application to SOAs in Data Mining
Some researchers proposed a Particle
Swarm Optimizer as a tool for Data Mining
They found that Particle Swarm
Optimizers proved to be a suitable
candidate for classification tasks
Reference
Tiago Sousa, Ana Neves, Arlindo Silva, Swarm Optimisation as a New Tool for Data
Mining. Proceedings of the 17th International Symposium on Parallel and
Distributed Processing, Page: 144.2 , 2003, ISBN:0-7695-1926-1
13
Masaryk University, Brno, Czech Republic , Wed
14. The Bees Algorithm (BA)
Bees in nature
Proposed Bees Algorithm
14
Masaryk University, Brno, Czech Republic , Wed
15. Bees in Nature
1- A colony of honey bees can extend itself
over long distances in multiple directions
(more than 10 km)
15
Masaryk University, Brno, Czech Republic , Wed
16. Bees in Nature
Flower patches with plentiful amounts of nectar
or pollen that can be collected with less effort
should be visited by more bees, whereas patches
with less nectar or pollen should receive fewer
bees
16
Masaryk University, Brno, Czech Republic , Wed
17. Bees in Nature
2- Scout bees search randomly from one
patch to another
17
Masaryk University, Brno, Czech Republic , Wed
18. Bees in Nature
3- The bees who return to the hive,
evaluate the different patches depending on
certain quality threshold (measured as a
combination of some elements, such as
sugar content)
18
Masaryk University, Brno, Czech Republic , Wed
19. Bees in Nature
4- They deposit their nectar or pollen go to
the “dance floor” to perform a “waggle
dance”
19
Masaryk University, Brno, Czech Republic , Wed
20. Bees in Nature
5- Bees communicate through this waggle
dance which contains the following
information:
1. The direction of flower patches
(angle between the sun and the
patch)
2. The distance from the hive
(duration of the dance)
3. The quality rating (fitness)
(frequency of the dance)
20
Masaryk University, Brno, Czech Republic , Wed
21. Bees in Nature
These information helps the colony to send
its bees precisely
6- Follower bees go after the dancer bee to
the patch to gather food efficiently and
quickly
21
Masaryk University, Brno, Czech Republic , Wed
22. Bees in Nature
7- The same patch will be advertised in the
waggle dance again when returning to the
hive is it still good enough as a food source
(depending on the food level) and more
bees will be recruited to that source
8- More bees visit flower patches with
plentiful amounts of nectar or pollen
22
Masaryk University, Brno, Czech Republic , Wed
23. Bees in Nature
Thus, according to the fitness, patches can
be visited by more bees or may be
abandoned
23
Masaryk University, Brno, Czech Republic , Wed
24. Proposed Bees Algorithm (BA)
The Bees Algorithm is an optimisation
algorithm inspired by the natural foraging
behaviour of honey bees to find the optimal
solution
The following figure shows the pseudo code
of the algorithm in its simplest form
24
Masaryk University, Brno, Czech Republic , Wed
25. Proposed Bees Algorithm (BA)
1. Initialise population with random solutions.
2. Evaluate fitness of the population.
3. While (stopping criterion not met)
//Forming new population.
4. Select sites for neighbourhood search.
5. Recruit bees for selected sites (more bees for
best e sites) and evaluate fitnesses.
6. Select the fittest bee from each patch.
7. Assign remaining bees to search randomly
and evaluate their fitnesses.
8. End While.
Pseudo code of the basic bees algorithm
25
Masaryk University, Brno, Czech Republic , Wed
26. Proposed Bees Algorithm (BA)
The algorithm requires a number of parameters
to be set: 100
Number of scout bees n 10
Number of sites selected m out of n visited sites
3
Number of best sites e out of m selected sites
Number of bees recruited for best e sites nep or
(n2) 40 in neighborhood area Rich
Number of bees recruited for the other (m-e)
selected sites which is nsp or (n1) 20
Poor
Initial size of patches ngh which includes site and
its neighbourhood and stopping criterion 0-1 (0.2)
Number of algorithm steps repetitions imax 10,300,1000
26
Masaryk University, Brno, Czech Republic , Wed
27. Proposed Bees Algorithm (BA)
The following figure shows the flowchart of
the Basic Bees Algorithm
27
Masaryk University, Brno, Czech Republic , Wed
28. Initialise a Population of n Scout Bees
Evaluate the Fitness of the Population
Select m Sites for Neighbourhood Search
Neighbourhood Search
Determine the Size of Neighbourhood
(Patch Size ngh)
Recruit Bees for Selected Sites
(more Bees for the Best e Sites)
Select the Fittest Bee from Each Site
Assign the (n–m) Remaining Bees to Random Search
New Population of Scout Bees
28
Masaryk Flowchart ofCzech Basic BA
University, Brno, the Republic , Wed
29. Proposed Bees Algorithm (BA)
The following is a description of the
algorithm steps
1- The algorithm starts with the n scout bees
being placed randomly in the search space.
(for example n=100)
29
Masaryk University, Brno, Czech Republic , Wed
30. Proposed Bees Algorithm (BA)
2- The fitnesses of the sites visited by the scout bees after
return are evaluated in step 2 as follow:
The first scout bee is taken and trained with the data. (for
example: if we get 200 correct answer out of 1000 record, the
bee will give the evolution of 20%)
The second scout bee is taken and the same process is
repeated and we my get 50%
The processes will be repeated on the all scout bees and
evaluated through evaluation function known as Fitness,
which changes upon the studied problem
30
Masaryk University, Brno, Czech Republic , Wed
31. Proposed Bees Algorithm (BA)
The evaluation of the 100 scout bees is
stored in array as follow:
1 2 3 4 5 6 … … ... 99 100
20% 50% 60% 30% 80% 10% … … … 35% 72%
Then the array will be reordered based on the
evaluation from the higher to the lower value
31
Masaryk University, Brno, Czech Republic , Wed
32. Proposed Bees Algorithm (BA)
3- The m sites will be selected randomly (the
best evaluation to m scout bee) from n
For example m=10
1 2 3 4 5 6 7 8 9 10
80% 78% 75% 72% 69% 66% 65% 60% 59% 58%
Then we choose the best e site (scout bee)
out off m which is determined randomly
For example e=2, then m-e =10-2=8
32
Masaryk University, Brno, Czech Republic , Wed
33. Proposed Bees Algorithm (BA)
4- A neighborhood search sites of size ngh is
selected
Thus in this step a neighborhood size ngh is
determined which will be used to update the
m bees declared in the previous step
This is important as there might be better
solutions than the original solution in the
neighborhood area
Suppose ngh=0.5
33
Masaryk University, Brno, Czech Republic , Wed
34. Proposed Bees Algorithm (BA)
5- Recruit Bees for the selected sites and
evaluate the fitness of the sites
Number of bees (n2) will be selected
randomly to be sent to e sites (n2=40)
and choosing n1 bees randomly which their
number is less than n2, (n1=20) to be sent to
m-e sites
34
Masaryk University, Brno, Czech Republic , Wed
35. Proposed Bees Algorithm (BA)
6- Choosing the best bee from each site (the
highest fitness) to form the next bee population
This is not exist in nature, it has been placed in
the algorithm to reduce the number of sites to be
explored
35
Masaryk University, Brno, Czech Republic , Wed
36. Proposed Bees Algorithm (BA)
The best bee from each site of m sites is selected
as follow:
The first site will be taken (for example a site from
e sites)
An array contains n2=40 bees will be constructed,
where the value of each bee is equal to the value of
the original scout bee with a little modification
depending on the neighborhood ngh
36
Masaryk University, Brno, Czech Republic , Wed
37. Proposed Bees Algorithm (BA)
The data will be trained on the 40 bees and
evaluated through the fitness function.
The results will be stored in temporary array.
The array will be ordered and the best value will
be taken
1 2 3 … 40
82% 81.2% 79.9% … 79.2%
37
Masaryk University, Brno, Czech Republic , Wed
38. Proposed Bees Algorithm (BA)
The step 6 is repeated for all m sites.
At the end we will get the best m=10 bees which
will be stored at the beginning of the array (n=100)
1 2 3 4 5 6 … 10 11 … 99 100
82% 79% 77% 73% 70% 67% … 58.2%
38
Masaryk University, Brno, Czech Republic , Wed
39. Proposed Bees Algorithm (BA)
Searches in the neighborhood of the best e
sites which represent more promising
solutions are made more detailed by
recruiting more bees to follow them than the
other selected bees.
Together with scouting, this differential
recruitment is a key operation of the Bees
Algorithm
39
Masaryk University, Brno, Czech Republic , Wed
40. Proposed Bees Algorithm (BA)
7- Initials new population:
The remaining bees in the population will be
assigned randomly around the search space
(values from 11 to 100 in the previous array)
The new population becomes as follow:
1 2 3 4 5 6 … 10 11 … 99 100
82% 79% 77% 73% 70% 67% … 58.2% Random values
40
Masaryk University, Brno, Czech Republic , Wed
41. Proposed Bees Algorithm (BA)
8- The loop counter is reduced and the steps
two to seven are repeated until the stopping
criterion is met. (ending the number of the
repetitions imax)
For example imax=1000
41
Masaryk University, Brno, Czech Republic , Wed
42. Proposed Bees Algorithm (BA)
At the end of each iteration, the colony will
have two parts to its new population
representatives from each selected patch and
other scout bees assigned to conduct random
searches
42
Masaryk University, Brno, Czech Republic , Wed
43. Simple Example: Function
Optimisation
Here are a simple example about how Bees
algorithm works
The example explains the use of bees
algorithm to get the best value
representing a mathematical function
(functional optimal)
43
Masaryk University, Brno, Czech Republic , Wed
44. Simple Example
The following figure shows the mathematical
function
44
Masaryk University, Brno, Czech Republic , Wed
45. Simple Example
1- The first step is to initiate the population
with any 10 scout bees with random search
and evaluate the fitness. (n=10)
45
Masaryk University, Brno, Czech Republic , Wed
46. Simple Example
y
*
* *
* *
*
* * * *
x
Graph 1. Initialise a Population of (n=10) Scout Bees
with random Search and evaluate the fitness.
46
Masaryk University, Brno, Czech Republic , Wed
47. Simple Example
2- Population evaluation fitness:
an array of 10 values in constructed and
ordered in ascending way from the highest
value of y to the lowest value of y depending
on the previous mathematical function
47
Masaryk University, Brno, Czech Republic , Wed
48. Simple Example
3- The best m site is chosen randomly ( the
best evaluation to m scout bee) from n
m=5, e=2, m-e=3
48
Masaryk University, Brno, Czech Republic , Wed
49. Simple Example
y
e
▪
m
▪ ▫
▫ ▫
*
* * * *
x
Graph 2. Select best (m=5) Sites for Neighbourhood Search:
(e=2) elite bees “▪” and (m-e=3) other selected bees“▫”
49
Masaryk University, Brno, Czech Republic , Wed
50. Simple Example
4- Select a neighborhood search site upon
ngh size:
Assign random neighborhood ngh as follow
50
Masaryk University, Brno, Czech Republic , Wed
51. Simple Example
y
▪
▪ ▫
▫ ▫
x
Graph 3. Determine the Size of Neighbourhood (Patch Size ngh)
51
Masaryk University, Brno, Czech Republic , Wed
52. Simple Example
5- recruits more bees to the selected sites
and evaluate the fitness to the sites:
Sending bees to e sites (rich sites) and m-e
sites (poor sites).
More bees will be sent to the e site.
n2 = 4 (rich)
n1 = 2 (poor)
52
Masaryk University, Brno, Czech Republic , Wed
53. Simple Example
**
**
y **
*
*
▪
*
*
*
▪
*
*
*
▫*
*
*
▫ ▫
*
* *
x
Graph 4. Recruit Bees for Selected Sites
(more Bees for the e=2 Elite Sites)
53
Masaryk University, Brno, Czech Republic , Wed
54. Simple Example
6- Select the best bee from each location
(higher fitness) to form the new bees
population.
Choosing the best bee from every m site as
follow:
54
Masaryk University, Brno, Czech Republic , Wed
55. Simple Example
y
*
* *▪
*
*
▪
*
*
*
▫
*
*
*
▫ ▫
*
* *
x
Graph 5. Select the Fittest Bee * from Each Site
55
Masaryk University, Brno, Czech Republic , Wed
56. Simple Example
7- initializes a new population:
Taking the old values (5) and assigning random
values (5) to the remaining values n-m
56
Masaryk University, Brno, Czech Republic , Wed
57. Simple Example
y
e
o
*
* *
m
o * * o
o
o
x
Graph 6. Assign the (n–m) Remaining Bees to Random Search
57
Masaryk University, Brno, Czech Republic , Wed
58. Simple Example
8- the loop counter will be reduced and the
steps from two to seven will be repeated until
reaching the stopping condition (ending the
number of repetitions imax)
At the end we reach the best solution as
shown in the following figure
This best value (best bees from m) will
represent the optimum answer to the
mathematical function
58
Masaryk University, Brno, Czech Republic , Wed
59. Simple Example
y
*
*
*
* *
x
Graph 7. Find The Global Best point
59
Masaryk University, Brno, Czech Republic , Wed
60. BA- Applications
Function Optimisation
BA for TSP
Training NN classifiers like MLP, LVQ, RBF
and SNNs
Control Chart Pattern Recognitions
Wood Defect Classification
ECG Classification
Electronic Design
60
Masaryk University, Brno, Czech Republic , Wed
61. BA- Applications
Mechanical designs like:
Design of welded beam
Design of coil spring
Digital Filter Optimisation
Fuzzy Control Design
Data Clustering (solving the local optimum
for K-means algorithm)
Robot control
61
Masaryk University, Brno, Czech Republic , Wed
62. Data Mining Rules Pruning Using BA
The aim of the research is to develop a good
learning algorithm able to generate a good set of
rules
RULES-5 Inductive Learning algorithm has been
used for extracting if-then classification rules from
set of examples have continuous and discrete
attributes
62
Masaryk University, Brno, Czech Republic , Wed
63. Data Clustering Using BA
K-means clustering is one of the most popular
clustering methods because of its simplicity and
computational efficiency. K-means clustering
involves search and optimization
The main problem with this clustering method is its
tendency to converge to local optima
A work has been done by integrating the simplicity
of the k-means algorithm with the capability of the
Bees Algorithm to avoid local optima
63
Masaryk University, Brno, Czech Republic , Wed
64. Data Clustering Using BA
Briefly, the job of the BA is to search for suitable
centres of the clusters (c1, c2,…,ck) which makes
the Euclidian distance dij as lower as possible
n
d ij = ∑ (x
k =1
ik − x jk ) 2
64
Masaryk University, Brno, Czech Republic , Wed
65. Optimising NNs for Identification of
Wood Defects Using the BA
An application of the Bees Algorithm to the
optimisation of neural networks for the
identification of defects in wood veneer sheets
Authors claimed that the accuracy obtained is
comparable to that achieved using
backpropagation
However, the Bees Algorithm proved to be
considerably faster
65
Masaryk University, Brno, Czech Republic , Wed
66. Application of the BA to Fuzzy
Clustering
A work has been done on combining the Bees
Algorithm with the FCM algorithm which
improved the fuzzy clustering results compared
to the traditional C-means algorithm in most
cases
They also proved that the Bees Algorithms
produces better results than those of the GA
combined with FCM
66
Masaryk University, Brno, Czech Republic , Wed
67. BA pros and cons
The advantages of the BA
Very efficient in finding optimal solutions
Overcoming the problem of local optima
The disadvantages of the BA
It is using a number of tunable parameters
The parameters values could be set by
conducting a small number of trails
67
Masaryk University, Brno, Czech Republic , Wed
68. Conclusion
A new optimisation algorithm has been presented
Authors claimed that the algorithm has
remarkable robustness, producing 100% success
rate in all cases they have tackled
The algorithm outperformed other techniques in
terms of speed of optimisation and accuracy of
the obtained results
68
Masaryk University, Brno, Czech Republic , Wed
69. BA Web Site (Cardiff University, UK)
http://www.bees-algorithm.com/
69
Masaryk University, Brno, Czech Republic , Wed
70. Acknowledgment
• Thanks to the Erasmus windows3
Consortium, especially the Lund University
team, Sweden (the main coordinator of the
project) who gave me the chance to
participate in this project
• Thanks to the host university, Masaryk
University team, especially Dr. Lubomir
Poplinsky from IF, and Mrs Amal Al-Khatib
from the international office who made the life
easy for me in Brno
70
Masaryk University, Brno, Czech Republic , Wed
71. References
• Salem Z. Ades N and Hilali E. RULES-5 Algorithm Enhancement by Using Bees Algorithm,
Res. J. of Aleppo Univ. Engineering Science Series No.66. 2009
• Pham DT, Ghanbarzadeh A, Koc E, Otri S, Rahim S and Zaidi M. The Bees Algorithm.
Technical Note, Manufacturing Engineering Centre, Cardiff University, UK, 2005
• Pham DT, Afify A, Koc A. "Manufacturing cell formation using the Bees Algorithm".
IPROMS 2007 Innovative Production Machines and Systems Virtual Conference, Cardiff,
UK.
• Pham DT, Koc E, Lee JY, and Phrueksanant J. Using the Bees Algorithm to schedule jobs for
a machine, Proc Eighth International Conference on Laser Metrology, CMM and Machine
Tool Performance, LAMDAMAP, Euspen, UK, Cardiff, p. 430-439, 2007.
• Pham D.T., Ghanbarzadeh A., Koc E., Otri S., Rahim S., and M.Zaidi. "The Bees Algorithm
- A Novel Tool for Complex Optimisation Problems"", Proceedings of IPROMS 2006
Conference, pp.454-461
• Pham DT, Soroka AJ, Ghanbarzadeh A, Koc E, Otri S, and Packianather M. Optimising
neural networks for identification of wood defects using the Bees Algorithm, Proc 2006 IEEE
International Conference on Industrial Informatics, Singapore, 2006.
71
Masaryk University, Brno, Czech Republic , Wed
72. References
• Pham DT, Darwish AH, Eldukhri EE, Otri S. "Using the Bees Algorithm to tune a fuzzy
logic controller for a robot gymnast."", Proceedings of IPROMS 2007 Conference
• Pham DT, Otri S, Afify A, Mahmuddin M, and Al-Jabbouli H. Data clustering using the Bees
Algorithm, Proc 40th CIRP Int. Manufacturing Systems Seminar, Liverpool, 2007.
• Pham DT, Ghanbarzadeh A. "Multi-Objective Optimisation using the Bees Algorithm"",
Proceedings of IPROMS 2007 Conference
• Pham DT, Muhamad Z, Mahmuddin M, Ghanbarzadeh A, Koc E, Otri S. Using the bees
algorithm to optimise a support vector machine for wood defect classification. IPROMS 2007
Innovative Production Machines and Systems Virtual Conference, Cardiff, UK.
• Pham DT, Koc E, Ghanbarzadeh A, and Otri S. Optimisation of the weights of multi-layered
perceptrons using the Bees Algorithm, Proc 5th International Symposium on Intelligent
Manufacturing Systems, Turkey, 2006.
• Pham DT, Soroka AJ, Koc E, Ghanbarzadeh A, and Otri S. Some applications of the Bees
Algorithm in engineering design and manufacture, Proc Int. Conference on Manufacturing
Automation (ICMA 2007), Singapore, 2007.
72
Masaryk University, Brno, Czech Republic , Wed
73. References
• Pham DT, Ghanbarzadeh A, Koc E, and Otri S. Application of the Bees Algorithm to the
training of radial basis function networks for control chart pattern recognition, Proc 5th CIRP
International Seminar on Intelligent Computation in Manufacturing Engineering (CIRP
ICME '06), Ischia, Italy, 2006.
• Pham DT, Otri S, Ghanbarzadeh A, and Koc E. Application of the Bees Algorithm to the
training of learning vector quantisation networks for control chart pattern recognition, Proc
Information and Communication Technologies (ICTTA'06), Syria, p. 1624-1629, 2006.
• Pham DT, Castellani M, and Ghanbarzadeh A. Preliminary design using the Bees Algorithm,
Proc Eighth International Conference on Laser Metrology, CMM and Machine Tool
Performance, LAMDAMAP, Euspen, UK, Cardiff, p. 420-429, 2007.
73
Masaryk University, Brno, Czech Republic , Wed
Local search is used for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution maximizing a criterion among a number of candidate solutions. Local search algorithms move from solution to solution in the space of candidate solutions (the search space) until a solution deemed optimal is found or a time bound is elapsed. For example local search has been applied to the traveling salesman problem, in which a solution is a cycle containing all nodes of the graph and the target is to minimize the total length of the cycle; A local search algorithm starts from a candidate solution and then iteratively moves to a neighbor solution. Global optimization deals with the optimization of a function or a set of functions to some criteria. In real-life problems, functions of many variables have a large number of local minima and maxima. Finding an arbitrary local optimum is relatively straightforward by using local optimization methods. Finding the global maximum or minimum of a function is much more challenging and has been practically impossible for many problems so far.
This paper has described the use of the Bees Algorithm to train the LVQ neural network for control chart pattern recognition. Despite the high dimensionality of the problem – each bee represented 2160 parameters that had to be determined – the algorithm still succeeded to train more accurate classifiers than that produced by the standard LVQ training algorithm. Future work will be directed at investigating classifiers based on other neural network paradigms and comparing their performances.
This paper has described the use of the Bees Algorithm to train the LVQ neural network for control chart pattern recognition. Despite the high dimensionality of the problem – each bee represented 2160 parameters that had to be determined – the algorithm still succeeded to train more accurate classifiers than that produced by the standard LVQ training algorithm. Future work will be directed at investigating classifiers based on other neural network paradigms and comparing their performances.