Computer ScienceGenetic Algorithms Slide 1 Random/Exhaustive Search l Generate and Test 1. Generate a candidate solution and test to see if it solves the.

Slides:



Advertisements
Similar presentations
Local optimization technique G.Anuradha. Introduction The evaluation function defines a quality measure score landscape/response surface/fitness landscape.
Advertisements

G5BAIM Artificial Intelligence Methods
Artificial Intelligence Presentation
Biologically Inspired Computing: Operators for Evolutionary Algorithms
Exact and heuristics algorithms
Computer Science Genetic Algorithms8/23/20011 Applications Boeing 777 engines designed by GE I2 technologies ERP package uses Gas John Deere – manufacturing.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Genetic Algorithms Sushil J. Louis Evolutionary Computing Systems LAB Dept. of Computer Science University of Nevada, Reno
Computability and Complexity 20-1 Computability and Complexity Andrei Bulatov Random Sources.
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
Genetic Algorithms for Bin Packing Problem Hazem Ali, Borislav Nikolić, Kostiantyn Berezovskyi, Ricardo Garibay Martinez, Muhammad Ali Awan.
Computer ScienceGenetic Algorithms Slide 1 Random/Exhaustive Search l Generate and Test 1. Generate a candidate solution and test to see if it solves the.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
The Adaptive Hierarchical Fair Competition (HFC) Model for EA’s Jianjun Hu, Erik D. Goodman Kisung Seo, Min Pei Genetic Algorithm Research &Applications.
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
Local Search and Stochastic Algorithms Solution tutorial 4.
MAE 552 – Heuristic Optimization Lecture 4 January 30, 2002.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Computer Science Genetic Algorithms CS 776: Evolutionary Computation Syllabus Objectives: –Learn about Evolutionary Computation.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Optimization via Search CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Island Based GA for Optimization University of Guelph School of Engineering Hooman Homayounfar March 2003.
Evolutionary algorithms
Genetic Algorithm.
Genetic Algorithms and Ant Colony Optimisation
Optimal n fe Tian-Li Yu & Kai-Chun Fan. n fe n fe = Population Size × Convergence Time n fe is one of the common used metrics to measure the performance.
Artificial Intelligence CS482, CS682, MW 1 – 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis,
An Introduction to Artificial Life Lecture 4b: Informed Search and Exploration Ramin Halavati In which we see how information.
Design & Analysis of Algorithms Combinatory optimization SCHOOL OF COMPUTING Pasi Fränti
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
L ECTURE 3 Notes are modified from EvoNet Flying Circus slides. Found at: www2.cs.uh.edu/~ceick/ai/EC1.ppt.
Simulated Annealing.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Fuzzy Genetic Algorithm
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
New Mexico Computer Science For All Algorithm Analysis Maureen Psaila-Dombrowski.
Exact and heuristics algorithms
Local Search Algorithms
Local Search Pat Riddle 2012 Semester 2 Patricia J Riddle Adapted from slides by Stuart Russell,
1 Genetic Algorithms and Ant Colony Optimisation.
Genetic Algorithms Czech Technical University in Prague, Faculty of Electrical Engineering Ondřej Vaněk, Agent Technology Center ZUI 2011.
Chapter 9 Genetic Algorithms.  Based upon biological evolution  Generate successor hypothesis based upon repeated mutations  Acts as a randomized parallel.
Speeding Up Warehouse Physical Design Using A Randomized Algorithm Minsoo Lee Joachim Hammer Dept. of Computer & Information Science & Engineering University.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
Local Search and Optimization Presented by Collin Kanaley.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Artificial Intelligence CS482, CS682, MW 1 – 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis,
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
Optimization Problems
In the name of ALLAH Presented By : Mohsen Shahriari, the student of communication in Sajad institute for higher education.
Local Search. Systematic versus local search u Systematic search  Breadth-first, depth-first, IDDFS, A*, IDA*, etc  Keep one or more paths in memory.
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
ROBOT NAVIGATION AI Project Asmaa Sehnouni Jasmine Dsouza Supervised by :Dr. Pei Wang.
Optimization Problems
Evolutionary Computation
CSCI 4310 Lecture 10: Local Search Algorithms
Genetic Algorithms, Search Algorithms
Advanced Artificial Intelligence Evolutionary Search Algorithm
Optimization Problems
This project consists of the design and optimization of jet engines
Area Coverage Problem Optimization by (local) Search
Coevolutionary Automated Software Correction
Presentation transcript:

Computer ScienceGenetic Algorithms Slide 1 Random/Exhaustive Search l Generate and Test 1. Generate a candidate solution and test to see if it solves the problem 2. Repeat l Information used by this algorithm You know when you have found the solution

Computer ScienceGenetic Algorithms Slide 2 Hill Climbing 1. Generate a candidate solution by modifying the last solution, S 2. If the new solution, N, is “better” than S then S := N 3. Repeat l Local Search l Information used by this algorithm Compare two candidate solutions and tell which is better

Computer ScienceGenetic Algorithms Slide 3 Population of Hill Climbers l Randomly generate initial population of hill climbers (Randomly generate initial candidate solutions) l Do hill climbing in parallel l After time t, choose best solution in population l Information used by this algorithm Same as hill climbing

Computer ScienceGenetic Algorithms Slide 4 Genetic Algorithms l Population of information exchanging hill climbers l Concentrates resources in promising areas of the search space l Information used: Same as hillclimbing

Computer ScienceGenetic Algorithms Slide 5 Hard problems l Computational complexity, problem size = n Binary SearchO(log(n)) Linear SearchO(n) Bubble SortO(n^2) SchedulingNP-complete (at least exponential == O(a^n)

Computer ScienceGenetic Algorithms Slide 6 Hard problems l Poorly defined RoboticsHow do we catch a ball, navigate, play basketball User Interfaces Predict next command, adapt to individual user MedicineProtein structure prediction, Is this tumor benign, design drugs DesignDesign bridge, jet engines, Circuits, wings ControlNonlinear controllers

Computer ScienceGenetic Algorithms Slide 7 Search as a solution to hard problems l Strategy: generate a potential solution and see if it solves the problem l Make use of information available to guide the generation of potential solutions l How much information is available? Very little: We know the solution when we find it Lots: linear, continuous, … Modicum: Compare two solutions and tell which is “better”

Computer ScienceGenetic Algorithms Slide 8 Search tradeoff l Very little information for search implies we have no algorithm other than RES. We have to explore the space thoroughly since there is no other information to exploit l Lots of information (linear, continuous, …) means that we can exploit this information to arrive directly at a solution, without any exploration l Modicum of information (compare two solutions) implies that we need to use this information to tradeoff exploration of the search space versus exploiting the information to concentrate search in promising areas

Computer ScienceGenetic Algorithms Slide 9 Exploration vs Exploitation l More exploration means Better chance of finding solution (more robust) Takes longer l More exploitation means Less chance of finding solution, better chance of getting stuck in a local optimum Takes less time

Computer ScienceGenetic Algorithms Slide 10 Choosing a search algorithm l The amount of information available about a problem influences our choice of search algorithm and how we tune this algorithm l How does a search algorithm balance exploration of a search space against exploitation of (possibly misleading) information about the search space? l What assumptions is the algorithm making?

Computer ScienceGenetic Algorithms Slide 11 Genetic Algorithm l Generate pop(0) l Evaluate pop(0) l T=0 l While (not converged) do Select pop(T+1) from pop(T) Recombine pop(T+1) Evaluate pop(T+1) T = T + 1 l Done