Whale Optimization Algorithm

Slides:



Advertisements
Similar presentations
Particle Swarm Optimization
Advertisements

Modeling and Analysis of Random Walk Search Algorithms in P2P Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE, Rensselaer Polytechnic Institute.
Particle Swarm Optimization (PSO)
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
Algorithms For Inverse Reinforcement Learning Presented by Alp Sardağ.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Genetic Algorithm.
Swarm Intelligence 虞台文.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Force-Directed Placement Heuristics A Comparative Study.
(Particle Swarm Optimisation)
1 IE 607 Heuristic Optimization Particle Swarm Optimization.
Topics in Artificial Intelligence By Danny Kovach.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
1 A New Method for Composite System Annualized Reliability Indices Based on Genetic Algorithms Nader Samaan, Student,IEEE Dr. C. Singh, Fellow, IEEE Department.
Tetris Agent Optimization Using Harmony Search Algorithm
Biologically Inspired Computation Ant Colony Optimisation.
Authors: Soamsiri Chantaraskul, Klaus Moessner Source: IET Commun., Vol.4, No.5, 2010, pp Presenter: Ya-Ping Hu Date: 2011/12/23 Implementation.
Particle Swarm Optimization (PSO)
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Journal of Computational and Applied Mathematics Volume 253, 1 December 2013, Pages 14–25 Reporter : Zong-Dian Lee A hybrid quantum inspired harmony search.
Particle Swarm Optimization (PSO) Algorithm. Swarming – The Definition aggregation of similar animals, generally cruising in the same directionaggregation.
Swarm Intelligence. Content Overview Swarm Particle Optimization (PSO) – Example Ant Colony Optimization (ACO)
Since the 1970s that the idea of a general algorithmic framework, which can be applied with relatively few modifications to different optimization problems,
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Genetic Algorithm (Knapsack Problem)
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Enhanced MWO Training Algorithm to Improve Classification Accuracy
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Discrete ABC Based on Similarity for GCP
Scientific Research Group in Egypt (SRGE)
AEEICB-2016 PAPER ID- 187 Voltage Stability Enhancement and Voltage Deviation Minimization Using Ant-Lion Optimizer Algorithm Indrajit N. Trivedi 1 Siddharth.
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Spider Monkey Optimization Algorithm
Particle Swarm Optimization
PSO -Introduction Proposed by James Kennedy & Russell Eberhart in 1995
Ana Wu Daniel A. Sabol A Novel Approach for Library Materials Acquisition using Discrete Particle Swarm Optimization.
Meta-heuristics Introduction - Fabien Tricoire
School of Computer Science & Engineering
Traffic Simulator Calibration
Tabu Search Review: Branch and bound has a “rigid” memory structure (i.e. all branches are completed or fathomed). Simulated Annealing has no memory structure.
B. Jayalakshmi and Alok Singh 2015
Chapter 6: Genetic Algorithms
CSC 380: Design and Analysis of Algorithms
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
Advanced Artificial Intelligence Evolutionary Search Algorithm
CS621: Artificial Intelligence
metaheuristic methods and their applications
Scientific Research Group in Egypt (SRGE)
Grey Wolf Optimizer Seyedali Mirjalili, Seyed Mohammad Mirjalili and Andrew Lewis Advances in Engineering Software, Volume 69, March 2014, Pages
Flower Pollination Algorithm
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Department of Information Management National Taiwan University
Lecture 9: Tabu Search © J. Christopher Beck 2005.
现代智能优化算法-粒子群算法 华北电力大学输配电系统研究所 刘自发 2008年3月 1/18/2019
Boltzmann Machine (BM) (§6.4)
SWARM INTELLIGENCE Swarms
Beyond Classical Search
CSC 380: Design and Analysis of Algorithms
Population Methods.
Presentation transcript:

Whale Optimization Algorithm Dr. Ahmed Fouad Ali Faculty of Computers and Informatics Suez Canal University

Outline Whale Optimization Algorithm (WOA) (History and main idea) Inspiration and foraging behavior The basic concepts of the Whale optimization algorithm Encircling prey Exploitation phase: bubble-net attacking method Exploration phase: search for prey The WOA algorithm References

Whale Optimization Algorithm (WOA) (History and main idea) The whale optimization algorithm (WOA) is a novel meta- heuristics algorithm proposed by Mirjalili at. el WOA is a population based method WOA simulate bubble-net attacking method of the humpback whales when they hunting their preys.

Inspiration and foraging behavior Whales are considered as the biggest mammals in the world. They are intelligent due to the spindle cells in their brain. The whales are living in groups and they are able to develop their own dialect. There are 7 types of whales and the humpback whale is one of these types.

Inspiration and foraging behavior (Cont.) It has a special hunting mechanism which is called bubble-net feeding method. This foraging behavior is done by crating a special bubbles in a spiral shape or (9 shape) path.

The basic concepts of the Whale optimization algorithm (Encircling prey) Humpback whales know the location of prey and encircle them. They consider the current best candidate solution is best obtained solution and near the optimal solution. After assigning the best candidate solution, the other agents try to update their positions towards the best search agent as shown in the following equation

The basic concepts of the Whale optimization algorithm (Encircling prey) (Cont.) Where t is the current iteration, A and C are coefficient vectors, X* is the position vector of the best solution, and X indicates the position vector of a solution, | | is the absolute value.

The basic concepts of the Whale optimization algorithm (Encircling prey) (Cont.) The vectors A and C are calculated as follows: Where components of a are linearly decreased from 2 to 0 over the course of iterations and r is random vector in [0; 1]

Exploitation phase: bubble-net attacking method The humpback whales attack the prey with the bubble-net mechanism. This mechanism is mathematical formulated as follow: {Shrinking encircling mechanism: In this mechanism, the value of A is a random value in interval [-a, a] and the value of a is decreased from 2 to 0 over the course of iterations as shown in Eq. 9.

Exploitation phase: bubble-net attacking method (Cont.) Spiral updating position mechanism In this mechanism, the distance between the whale location and the prey location is calculated then the helix-shaped movement of humpback is created as shown in the following equation Where D’ =| X*(t) - X(t) | is the distance between the prey (best solution) and the ith whale, b is a constant, l is a random number in [-1; 1].

Exploitation phase: bubble-net attacking method (Cont.) The humpback whales used the mentioned two mechanisms when they swim around the prey. We set the mathematical model of these two mechanisms, we assume that there is a probability of 50% to chose between these two mechanisms to update the position of whales as follow Where p is a random number in [0; 1]

Exploration phase: search for prey In the exploration phase, the humpback whales (search agents) search for prey (best solution) randomly and change their positions according the position of other whales. In order to force the search agent to move far a way from reference whale, we use the A with values > 1 or < 1 The mathematical model of the exploration phase is as follows Where Xrand is a random position vector chosen from the current population.

The WOA algorithm

The WOA algorithm (Cont.) Step 1. The standard whale optimization algorithm starts by setting the initial values of the population size n, the parameter a, coefficients A and C and the maximum number of iterations max_itr. line 1. Step 2. Initialize the iteration counter t. lines 2. Step 3. The initial population n is generated randomly and each search agent Xi in the population is evaluated by calculating its fitness function f(Xi). lines 3-6. Step 4. Assign the best search agent X. line 7 Step 5. The following steps are repeated until the termination criterion Satisfied. lines 9-30

The WOA algorithm (Cont.) Step 5.1. The iteration counter is increasing t = t + 1. line 9 Step 5.2. All the parameters a,A, C, l and P are updated. line 11 Step 5.3. The exploration and exploitations are applied according to the values of p and | A | line 12-27 Step 6. The best search agent X is updated. line 28 Step 7.The overall process is repeated until termination criteria satisfied. line 29 Step8. Produce the best found search agent (solution) so far X. line 30

References S. Mirjalili and A. Lewis, The Whale Optimization Algorithm. Advances in Engineering Software, 95, (2016), pp.51-67