Code for Computer Science

Emperor Penguin Optimizer   Learn Emperor Penguin Optimization Algorithm Step-by-Step. A bio-inspired algorithm which mimic the huddling behavior of Emperor Penguin. Video Chapters: Introduction: 00:00 What is emperor penguin optimization: 00:23 Emperor Penguin: 00:58 Emperor Penguin huddle: 01:50 Emperor Penguin Optimizer Flowchart: 03:19 Generate Emperor Penguin huddle boundary: 04:34 Calculate Temperature around huddle: 06:18 Calculate Distance between Emperor Penguins: 07:45 Relocate Effective Mover: 09:45 Emperor Penguin Optimization Steps: 10:52 Conclusion: 12:38 Emperor Penguin Optimizer is a Novel Bio-Inspired Metaheuristic Algorithm which is inspired by the huddling behavior of Emperor Penguin. Penguins are Aquatic Flightless Birds. Penguins spends their 50% life on the land and 50% life in the water. Penguin largest species is known as Emperor Penguin. Both male and female emperor penguins are similar in size. Emperor penguin is the only species which use huddle for their

Random Number Generator |Mid Square Method|   Algorithm: Step 1: Stating with n (4 digits long) Digit Number.   Step 2: Squaring it. Step 3: For 8 digit: Remove 2 lower and 2 higher order DigitStep 4. For 7 digit: Remove 1 higher-order digit & 2 lower order.Step 5. Repeat step 2. Mistake :   F or  7 digit:  Remove 1  higher-order  digit & 2  lower order. Another Example This method  will either begin repeatedly generating the same number or  Cycle  to a previous number in the sequence and loop indefinitely

OPTIMIZATION ENGINEERING Optimization: In Optimization we either minimize or maximize objective functions / cost function. No Free Lunch Theorem for Optimization No Free Lunch Theorem for Optimization According to No Free Lunch Theorem "There is no universal better algorithm exist that can solve all types of optimization problems". Today, Metaheuristic Optimization Algorithms are used in different areas to solve complex real work optimization problems. For example in Industrial Areas, Operation Research, Medical Field, Engineering design and other as you can see below:  History of Metaheuristic Optimization Algorithms: Genetic Algorithms (G.A.) - 1960's - 1970's Simulated Annealing (S.A.) - 1983 Tabu Search (T.S.) - 1986 Ant Colony Optimization Algorithm - 1992 Particle Swarm Optimization Algorithm - 1995 Differential Evolution (D.E.) -1997 Harmony Search (H.S.) - 2001 Honey Bee Algorithm (H.B.A.) - 2004 Artificial Bee Colony (A.B.C.) - 2005 ... Battle Royal Optimizat

No Free Lunch Theorem for Optimization No Free Lunch Theorem for Optimization According to No Free Lunch Theorem "There is no universal better algorithm exist that can solve all types of optimization problems". Today, Metaheuristic Optimization Algorithms are used in different areas to solve complex real work optimization problems. For example in Industrial Areas, Operation Research, Medical Field, Engineering design and other as you can see below:  History of Metaheuristic Optimization Algorithms: Genetic Algorithms (G.A.) - 1960's - 1970's Simulated Annealing (S.A.) - 1983 Tabu Search (T.S.) - 1986 Ant Colony Optimization Algorithm - 1992 Particle Swarm Optimization Algorithm - 1995 Differential Evolution (D.E.) -1997 Harmony Search (H.S.) - 2001 Honey Bee Algorithm (H.B.A.) - 2004 Artificial Bee Colony (A.B.C.) - 2005 ... Battle Royal Optimization Algorithm (B.R.O.A.) - 2020 In 1997, D.H. Wolpher and W. G. Macready published No Free Lunch Theorem for optimization.

 Black Hole Optimization Algorithm || BHO Algorithm The black hole algorithm is a Natural Heuristic Algorithm by simulating the ‘‘Black Hole’’ phenomenon in the universe.  Black Hole Optimization Algorithm is a new bio-inspired metaheuristic approach based on the observable fact of black hole phenomena. Black Hole : Region in the space where Gravity is so Strong. No object can escape from its powerful gravitational pull. Black holes are formed in the  space when star of massive size collapses. Anything falls into black hole is forever gone from our universe. Black Hole Optimization Algorithm Steps: Step 01: Randomly Initialize population for N candidate solutions in the search space. Consider Stars as initial population and each start is candidate solution. And Best  Candidate among all (i.e., Best Solution) is considered as Black Hole. Step 02: Calculate Fitness Values for each agent in the current population. Calculate fitness values for each candidate and best among all is consider

Battle Royale Optimization Algorithm Learn New optimization algorithm Battle Royale Optimization (BRO) Algorithm step-by-step with Example. Battle Royale Optimization Algorithm Video Chapters: Introduction: 00:00 Battle Royale Optimization Algorithm: 01:17 About Battle Royal: 02:46 Battle Royal Video Games: 03:27 Battle Royal Games Key Components: 04:40 BRO Algorithm: 06:30 Battle Royale Optimization Algorithm Steps: 07:49 Battle Royale Optimization Algorithm Flowchart: 14:44 Conclusion: 16:00 Battle Royale Optimization Algorithm (BROA) is recently proposed Metaheuristic Algorithm. Battle Royale Optimization Algorithm is a Population based Metaheuristic Algorithm that is inspired by GAME. Battle Royale Optimization Algorithm is developed by Taymaz Rahkar Farshi. BRO algorithm is basically inspired by the genre of Digital Games (Battle Royale Video Games). Battle Royal video game is online Multiplayer video game. In 21st century Battle Royale word taken new meaning i.e., "Fictiona