Scientific Research Group in Egypt (SRGE)

Slides:



Advertisements
Similar presentations
Nelder Mead.
Advertisements

Optimal Analyses for 3  n AB Games in the Worst Case Li-Te Huang and Shun-Shii Lin Dept. of Computer Science & Information Engineering, National Taiwan.
Assessment. Schedule graph may be of help for selecting the best solution Best solution corresponds to a plateau before a high jump Solutions with very.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
1 Assessment of Imprecise Reliability Using Efficient Probabilistic Reanalysis Farizal Efstratios Nikolaidis SAE 2007 World Congress.
Particle Swarm Optimization Algorithms
Genetic Algorithm.
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Swarm Intelligence 虞台文.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Efficient Processing of Top-k Spatial Preference Queries
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
Analysis of Algorithms CS 477/677 Instructor: Monica Nicolescu Lecture 7.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Genetic Algorithm(GA)
Swarm Intelligence. Content Overview Swarm Particle Optimization (PSO) – Example Ant Colony Optimization (ACO)
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)
Genetic Algorithms.
Advanced Computing and Networking Laboratory
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Evolutionary Algorithms Jim Whitehead
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)
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
Whale Optimization Algorithm
Ana Wu Daniel A. Sabol A Novel Approach for Library Materials Acquisition using Discrete Particle Swarm Optimization.
Traffic Simulator Calibration
Chapter 6: Genetic Algorithms
Multy- Objective Differential Evolution (MODE)
Artificial Intelligence (CS 370D)
Comparing Genetic Algorithm and Guided Local Search Methods
Genetic Algorithms overview
Modified Crossover Operator Approach for Evolutionary Optimization
Computational Intelligence
Scientific Research Group in Egypt (SRGE)
Flower Pollination Algorithm
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Multi-Objective Optimization
Department of Information Management National Taiwan University
Noémi Gaskó, Rodica Ioana Lung, Mihai Alexandru Suciu
Introduction Wireless Ad-Hoc Network
Introduction Swarm Intelligence
EE368 Soft Computing Genetic Algorithms.
Searching for solutions: Genetic Algorithms
Introduction to Genetic Algorithm and Some Experience Sharing
Continuous Density Queries for Moving Objects
Computational Intelligence
Efficient Processing of Top-k Spatial Preference Queries
Beyond Classical Search
Population Based Metaheuristics
Presentation transcript:

Scientific Research Group in Egypt (SRGE) Social Spider Optimization Algorithm Scientific Research Group in Egypt (SRGE) Dr. Ahmed Fouad Ali Suez Canal University, Dept. of Computer Science, Faculty of Computers and informatics Member of the Scientific Research Group in Egypt .

Scientific Research Group in Egypt www.egyptscience.net

Outline 1.Social spider optimization (SSO) (History and main idea) 2. Initializing the population 3. Fitness evaluation 4. Modeling of the vibrations through the communal web 5. Female cooperative operator 6. Male cooperative operator 7. Mating operator 8. Social spider optimization algorithm 9. References

Social spider optimization (SSO) (History and main idea) The social spider optimization (SSO) algorithm is a population based algorithm proposed by Cuevas et. al, 2013. There are two fundamental components of a social spider colony, social members and communal web. The social members is divided into males and females. The number of female spiders reaches 70%, while the number of male spiders reaches 30% of the total colony members.

Social spider optimization (SSO) (History and main idea) Female spider presents an attraction or dislike to other spiders according to their vibrations based on the weight and distance of the members Male spiders are divided into two classes, dominate and non-dominate male spiders Dominant male spiders, have better fitness characteristics in comparison to non-dominant. Mating operation allows the information exchange among members and it is performed by dominant males and female(s).

Social spider optimization (SSO) (History and main idea) A dominant male mates with one or all females within a specific range to produce offspring. In the social spider optimization algorithm (SSO), the communal web represents the search space. Each solution within the search space represents a spider position. The weight of each spider represents the fitness value of the solution.

Initializing the population The algorithm starts by initializing the population S of N spider positions (solution). The population contains of females fi and males mi. The number of females is randomly selected within the range of 65% - 90% and calculated by the following equation: The number of male spiders Nm is calculated as follows.

Initializing the population (Cont.) The female spider position fi is generated randomly between the lower initial parameter bound plow and the upper initial parameter bound phigh as follow. The male spider position mi is generated randomly as follow.

Fitness evaluation In the SSO algorithm, the weight of each spider represents the solution quality. The function value of each solution i is calculated as follow. Where J(si) is the fitness value obtained of the spider position si, the values worst and bests are the maximum and the minimum values of the solution in the population respectively. (minimization problem)

Modeling of the vibrations through the communal web The information among the colony members is transmitted through the communal web and encoded as a small vibrations. The vibrations depend on the weight and distance of the spider which has generated them. The information transmitted (vibrations) perceived by the individual i from member j are modeled as follow. Where the dij is the Euclidian distance between the spiders i and j.

Modeling of the vibrations through the communal web (Cont.) There are three special relationships of the vibrations between any pair of individuals as follows. Vibrations Vibci. The transmitted information (vibrations) between the individual i and the member c (sc), which is the nearest member to i with a higher weight can be defined as follow.

Modeling of the vibrations through the communal web Vibrations Vibbi. The transmitted information (vibrations) between the individual i and the member b (sb) which is the best member in the population S can be defined as follow. Vibrations Vibfi. The transmitted information (vibrations) between the individual i and the nearest female individual f(sf ) can be defined as follow.

Modeling of the vibrations through the communal web (Cont.)

Female cooperative operator The female spiders present an attraction or dislike over other irrespective of gender. The movement of attraction or repulsion depends on several random phenomena. A uniform random number rm is generated within the range [0,1]. If rm is smaller than a threshold PF, an attraction movement is generated; otherwise, a repulsion movement is produced as follows.

Male cooperative operator The male spider with a weight value above the median value of the male population is called a dominant D,. The other males with weights under the median are called non-dominant ND. The median weight is indexed by Nf + m. The position of the male spider can be modeled as follows.

Mating operator The mating in a social spider colony is performed by the dominant males and the female members. When a dominant male mg spider locates a set Eg of female members within a specific range r (range of mating), which is calculated as follow. The spider holding a heavier weight are more likely to influence the new product. The influence probability Psi of each member is assigned by the roulette wheal method

Social spider optimization algorithm Parameters setting Female and male spiders number Population initializing Solutions evaluation Female operator

Social spider optimization algorithm Male operator Social spider optimization algorithm Mating operator Termination criteria satisfied

References Cuevas, E., Cienfuegos, M., Zaldívar, D., Pérez-Cisneros, M. A swarm optimization algorithm inspired in the behavior of the social-spider, Expert Systems with Applications, 40 (16), (2013), pp. 6374-6384

Thank you Ahmed_fouad@ci.suez.edu.eg http://www.egyptscience.net