Professional Documents
Culture Documents
Admission Procedure CAT Applicants 2018 20 PGP Indore
Admission Procedure CAT Applicants 2018 20 PGP Indore
PROPOSED SOLUTION
RESULTS
CONCLUSION
REFERENCE
ABSTRACT
Artificial bee colony (ABC) is an algorithm, which has proved its importance in solving various
practical problems including engineering optimization problems. ABC algorithm is distinctively known
for being the youngest and most popular member of the family of population-based nature inspired
meta-heuristic swarm intelligence method. ABC has proved to be one of the most effective
algorithms over various other Nature Inspired Algorithms when being used for benchmark functions
and real world problems. The performance of search process of ABC depends on a random value
which tries to stabilize exploration and exploitation phase. With the purpose to enhance the
performance, it is required to balance the exploitation of optimal solution of the ABC and exploration
of search space. This report outlines 2 new hybrid of ABC algorithm with Genetic Algorithm that are
Genetically Mutated Bee Colony Optimization Technique (GMBC) and Tuning of GA parameters using
ABC. This report reviews Artificial Bee Colony (ABC) and Genetic Algorithm (GA), both of which are
two powerful meta-heuristics. This report explains some major defects of these two algorithms at
first then proposes 2 new hybrid models. Experimental results show that proposed hybrid algorithms
are effective and their performance including speed and accuracy beats other version.
Need of Combining Meta- Heuristic Algorithm
As we know that many practical control problems faced by control engineers are
non-linear in nature having higher order with time delay elements. The
Metaheuristic algorithm (GA & ABC) generally works good for linear system, but for
non-linear systems these algorithms converges to local maxima and many times they
even don’t give satisfactory result.
Genetic algorithm being very robust have high convergence rate for lower order
problems but for higher order practical problems convergence rate reduces and they
provide local maxima as optimal solution.
Artificial Bee Colony method being flexible, easy to implement and good exploration
of the solution but exploitation to found food sources is very bad and falls into local
optimum solution as a result of premature.
PROPOSED SOLUTION
2. Create initial bee population by assigning random position within search space The selection is done probabilistically i.e. by Roulette Wheel selection
3. Calculate cost of each position, from the cost function defined in the program The Roulette Wheel method requires fitness values which are computed from cost values
4. Now, sort population based on cost 10. Those bees food source whose abandonment counter exceeds abandonment limit will become Scout
5. Store details of 1st population in BestSol (variable to store best solution ever found) bees and they searches around the hive randomly.
6. Apply crossover and mutation to the population array 11. Now sort all the food sources explored based on cost and truncate the top food sources.
7. Initialize the abandonment counter values and set it to zero 12. Apply Crossover and Mutation on population so formed.
8. Now in the main loop 13. Store the best solution found in BestSol
for employed bees search for the new position of food source nearby and calculate the cost. 14. Repeat the main loop for n iterations
If calculated cost is better, then update the new bee position 15. Optimal values of Kp, Ki and Kd are stored in BestSol
This cost function will optimize the values of GA parameters i.e. (pm, pc and gamma) 8. Onlooker bees select the solution around which they explore for new food sources
GA parameters are optimized based on different cost function which will optimize PID The selection is done probabilistically i.e. by Roulette Wheel selection
parameters based on weighted sum of integral square error (ISE), Maximum peak overshoot The Roulette Wheel method requires fitness values which are computed from cost values
(Mp), Settling time (Ts) 9. Those bee’s food source whose abandonment counter exceeds abandonment limit will become
2. Initialize the variables as mentioned above Scout bees and they searches around the hive randomly.
3. Create initial bee population by assigning random position within search space 10. Now sort all the food sources explored based on cost and truncate the top food sources.
4. Calculate cost of each position, from the cost function defined in the program 11. For evaluating the cost, GA is evaluated for optimal value of mutation percentage(pm), crossover
5. Store details of Best Solution found in BestSol (variable to store best solution ever found in percentage(pc) and range factor for crossover(gamma).
randomly initialized population) 12. Store the best solution found in BestSol
6. Initialize the abandonment counter values and set it to zero
13. Repeat the main loop for n iterations.
7. Now in the main loop
14. Optimal values of Kp, Ki and Kd are stored in BestSol
for employed bees search for the new position of food source nearby and calculate the cost.
GA – Genetic Algorithm
via ABC
Comparison of different parameters of plant 1
GA – Genetic Algorithm
via ABC
Comparison of different parameters of plant 2
GA – Genetic Algorithm
via ABC
Comparison of different parameters of plant 3