Heuristics and Genetic Algorithms Michael D. Mobley The Boeing Company 12 July 2006.

Slides:



Advertisements
Similar presentations
Basics of Recursion Programming with Recursion
Advertisements

© Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems Introduction.
Algorithm Design Techniques
Fakultät für informatik informatik 12 technische universität dortmund Standard Optimization Techniques Peter Marwedel Informatik 12 TU Dortmund Germany.
Generative Design in Civil Engineering Using Cellular Automata Rafal Kicinger June 16, 2006.
How to do intraday capacity pricing in a continuous trade environment? 10 October 2011 NRA-TSO-PX meeting (Informal minutes, made during workshop, of the.
0 - 0.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
1 Automating the Generation of Mutation Tests Mike Papadakis and Nicos Malevris Department of Informatics Athens University of Economics and Business.
Chapter 4: Informed Heuristic Search
Chapter 18 Methodology – Monitoring and Tuning the Operational System Transparencies © Pearson Education Limited 1995, 2005.
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Computational Intelligence Winter Term 2009/10 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
0 Solving Problems in Groups ©2008, University of Vermont and PACER Center Solving Problems in Groups PCL Module 9.
1 Modeling and Simulation: Exploring Dynamic System Behaviour Chapter9 Optimization.
Absolute-Value Equations and Inequalities
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Addition 1’s to 20.
EC-111 Algorithms & Computing Lecture #11 Instructor: Jahan Zeb Department of Computer Engineering (DCE) College of E&ME NUST.
Test B, 100 Subtraction Facts
Week 1.
Chapter 12 Analyzing Semistructured Decision Support Systems Systems Analysis and Design Kendall and Kendall Fifth Edition.
Choosing an Order for Joins
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Foundations of Data Structures Practical Session #11 Sort properties, Quicksort algorithm.
13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
Types of Algorithms.
Case Study: Genetic Algorithms GAs are an area of AI research –used to solve search problems with potentially better performance than traditional search.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
© 2005 Prentice Hall6-1 Stumpf and Teague Object-Oriented Systems Analysis and Design with UML.
A GENETIC ALGORITHM APPROACH TO SPACE LAYOUT PLANNING OPTIMIZATION Hoda Homayouni.
EA* A Hybrid Approach Robbie Hanson. What is it?  The A* algorithm, using an EA for the heuristic.  An efficient way of partitioning the search space.
Imagine that I am in a good mood Imagine that I am going to give you some money ! In particular I am going to give you z dollars, after you tell me the.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
1 CS101 Introduction to Computing Lecture 24 Design Heuristics.
Genetic Algorithms: A Tutorial
Genetic Algorithm.
Genetic Algorithms CS121 Spring 2009 Richard Frankel Stanford University 1.
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Genetic Algorithms Michael J. Watts
More on Heuristics Genetic Algorithms (GA) Terminology Chromosome –candidate solution - {x 1, x 2,...., x n } Gene –variable - x j Allele –numerical.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
Evolution Programs (insert catchy subtitle here).
FORS 8450 Advanced Forest Planning Lecture 5 Relatively Straightforward Stochastic Approach.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
Types of Algorithms. 2 Algorithm classification Algorithms that use a similar problem-solving approach can be grouped together We’ll talk about a classification.
Optimization Problems
A survey of Constraint Handling Techniques in Evolutionary Computation Methods Author: Zbigneiw Michalewicz Presenter: Masoud Mazloom 27 th Oct
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Implementation & Integration Research Paper Presentation Nick Conway.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Genetic Algorithms.
Genetic Algorithms.
School of Computer Science & Engineering
CS101 Introduction to Computing Lecture 24 Design Heuristics
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
Types of Algorithms.
Types of Algorithms.
Types of Algorithms.
Traveling Salesman Problem by Genetic Algorithm
Presentation transcript:

Heuristics and Genetic Algorithms Michael D. Mobley The Boeing Company 12 July 2006

2 Heuristics and Genetic Algorithms Optimal Solutions Interest Systems Engineers –Up-Front Trade Studies –Resource Selection Problems Air Attack Resources to Prosecute Evolving Targets –Available Fuel –Available Number & Types of Weapons –Current Aircraft Locations –Current Target Priority Rules of Engagement –Systems architecting itself is a search process based on systems measures of effectiveness or attributes

3 Heuristics and Genetic Algorithms Function to Be Optimized Might Look Like This Figure 1. Sample Function

4 Heuristics and Genetic Algorithms Genetic Algorithms Search the Architecture Alternative Space Using These Components... –Genetic Representation of Problem –Method to Create Initial Population of Solutions –Evaluation Function to Rate Fitness of Solutions –Genetic Operators to Alter Children –Values for Parameters

5 Heuristics and Genetic Algorithms Heuristic –Literally, To Find a Way or To Guide –Help to Reduce the Search Space

6 Heuristics and Genetic Algorithms This Presentation Will Not… –Be an Exhaustive Discussion of How Genetic Algorithms Work –Discuss All Potentially Useful Heuristics What We Will Do… –Examine Similarities Between Genetic Algorithms and Heuristic Approaches –Explore a Hybrid Approach to Systems Architecting Using Genetic Algorithms and Heuristics

7 Heuristics and Genetic Algorithms Similarities Between the Two Approaches –Intimate Involvement with the Search Space Heuristics Limit the Space Genetic Algorithms Search the Space –Isolated Use Discouraged Neither One by Themselves May Get the Optimal Solution Both Together May Get Optimal Solution Faster –Iterative in Nature Genetic Algorithms are Recursive The First Heuristic Used May Not Significantly Reduce the Search Space

8 Heuristics and Genetic Algorithms A Hybrid Approach –For Each Genetic Algorithm Component… –Identify One or More Heuristics that Apply

9 Heuristics and Genetic Algorithms Genetic Representation of the Problem –Dont assume that the original statement of the problem is necessarily best, even the right one. –Sometimes the best way to defeat a system is to do so out of bounds. It may also be the best way to preserve it.

10 Heuristics and Genetic Algorithms Function to Be Optimized Might Look Like This Figure 1. Sample Function

11 Heuristics and Genetic Algorithms Method to Create Initial Population of Solutions –When choices must be made with unavoidably inadequate information, choose the best available and then watch to see whether future solutions appear faster than future problems. If so, the choice was at least adequate. If not, go back and choose again.

12 Heuristics and Genetic Algorithms Method to Create Initial Population of Solutions –Traveling Salesman Problem –Initial Parent Solutions [ ] and [ ]

13 Heuristics and Genetic Algorithms Evaluation Function to Rate Fitness of Solutions –No complex system can be optimum to all parties concerned, nor all functions optimized. –Regardless of what has gone before, the acceptance criteria determine what is actually built.

14 Heuristics and Genetic Algorithms Genetic Operators to Alter Children –The efficient architect, using contextual sense, continually looks for the likely misfits and redesigns the architecture so as to eliminate or minimize them.

15 Heuristics and Genetic Algorithms Genetic Operators to Alter Children –Traveling Salesman Problem –Create Offspring by Swapping Chromosomes in Positions Three through Six [ ] and [ ] Deal with Duplicate Children [ ] and [ ]

16 Heuristics and Genetic Algorithms Values for Parameters –For a system to meet its acceptance criteria to the satisfaction of all parties, it must be architected, designed, and built to do sono more and no less. –Different architectures can generate different behavior.

17 Heuristics and Genetic Algorithms Application to Your Problem –What Do You Wish to Optimize? –What Constraints Bound Your Problem? –How Can Your Problem Be Represented by Genetic Algorithm? –What Heuristics Can Aid the Genetic Algorithm? –What Is Your Optimal Solution?