1 Complex systems: How to think like nature Unintended consequences. Emergence: what’s right and what’s wrong with reductionism. Design: levels of abstraction/platforms.

Slides:



Advertisements
Similar presentations
CS6800 Advanced Theory of Computation
Advertisements

Peppered Moth Lab.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
02/03/07DePaul University, HON2071 Evolutionary Computation Module for HON207.
1 Introduction to Complex Systems: How to think like nature  The Aerospace Corporation. All Rights Reserved. Course overview: part 2 Russ Abbott.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
1 Introduction to Complex Systems: How to think like nature Russ Abbott Sr. Engr. Spec. Rotn to CCAE  The.
Iterative Improvement Algorithms
A Hybrid Heuristic for the Traveling Salesman Problem R. Baraglia, J. I. Hildalgo, R. Perego CMPSC 580, Spring 2006.
Genetic Algorithms Learning Machines for knowledge discovery.
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.
EAs for Combinatorial Optimization Problems BLG 602E.
Iterative Improvement Algorithms For some problems, path to solution is irrelevant: just want solution Start with initial state, and change it iteratively.
1 Introduction to Complex Systems: How to think like nature Russ Abbott Sr. Engr. Spec. Rotn to CCAE  The.
Memetic Algorithms By  Anup Kulkarni( )  Prashanth Kamle( ) Instructor: Prof. Pushpak Bhattacharyya.
Artificial Intelligence in Information Processing Genetic Algorithms by Theresa Kriese for Distributed Data Processing.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
GAlib A C++ Library of Genetic Algorithm Components Vanessa Herves Gómez Department of Computer Architecture and Technology,
Christoph F. Eick: Applying EC to TSP(n) Example: Applying EC to the TSP Problem  Given: n cities including the cost of getting from on city to the other.
Pawel Drozdowski – November Introduction GA basics Solving simple problem GA more advanced topics Solving complex problem Question and Answers.
Genetic Algorithms and Ant Colony Optimisation
1 Introduction to Complex Systems: How to think like nature  The Aerospace Corporation. All Rights Reserved. Evolution: how nature thinks Russ.
Comparative Psychology Evolution What is evolution & why are psychologists interested? What is evolution & why are psychologists interested? Reproductive.
Genetic algorithms Prof Kang Li
Ch.12 Machine Learning Genetic Algorithm Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
15-1 Notes: Adaptations and Natural Selection
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
1/27 Discrete and Genetic Algorithms in Bioinformatics 許聞廉 中央研究院資訊所.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
Immune Genetic Algorithms By Jeremy Moreau. References Licheng Jiao, Senior Member, IEEE, and Lei Wang, “A Novel Genetic Algorithm Based on Immunity,”
1 Genetic Algorithms and Ant Colony Optimisation.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
Evolution Michael J. Watts
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
1 Introduction to Complex Systems: How to think like nature Russ Abbott Sr. Engr. Spec. Rotn to CCAE  The.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Edge Assembly Crossover
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
CompSci On the Limits of Computing  Reasons for Failure 1. Runs too long o Real time requirements o Predicting yesterday's weather 2. Non-computable.
Mechanisms of Evolution What causes organisms to change over time?
Genetic Algorithms and TSP Thomas Jefferson Computer Research Project by Karl Leswing.
Chapter 13 Section 3 and more!. Objectives ▪ Describe an allele. ▪ Identify the five principles of natural selection. ▪ Describe how changes in allele.
Evolution: How Change Occurs Chapter Developing a Theory of Evolution evolutionary theory is fundamental to the study of Biology Genetics, ecology,
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
8-5 Notes: Natural Selection. SO HOW DID ORGANISMS BECOME SO WELL ADAPTED TO THEIR ENVIRONMENT?
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
CPS Today’s Topics Computer Science Program Execution Time: Intractable Algorithms Upcoming Parallel Computing Great Ideas, Chapter 14 Reading.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Stations.
Genetic Algorithms.
Genetic Algorithms.
Example: Applying EC to the TSP Problem
Yu-Chi Ho Jonathan T. Lee Harvard University Sep. 7, 2000
Basics of Genetic Algorithms (MidTerm – only in RED material)
Example: Applying EC to the TSP Problem
What has caused SUPERBUGS (antibiotic resistant bacteria) like MRSA?
Example: Applying EC to the TSP Problem
Peppered Moth.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Introduction to Evolution
SURVIVAL OF THE FITTEST
Presentation transcript:

1 Complex systems: How to think like nature Unintended consequences. Emergence: what’s right and what’s wrong with reductionism. Design: levels of abstraction/platforms. Evolutionary processes, genetic algorithms, and entities as nature’s memes. Wisdom of crowds: hierarchy, autonomy, commons, C2. Externalizing thought Feasibility ranges (vs. engineering margins) Simulations: floor and noticing emergence. Computer Science vs. Engineering

2 Try it out File > Models Library > Biology > Evolution > Peppered Moths Click Open

3 Peppered moths model At each time tick, a moth’s probability of survival—not being eaten by predators (not shown)—depends on –How close its color (1-9) is to the background color (0-8). –The “Selection” slider, which controls the impact of the environment. The higher the slider, the more important the environment. Moths both reproduce and die (of old age). –They may mutate, i.e., have offspring of a different color. Illustrates the nature of evolution. –Moth (and their colors) are rivals, not competitors. Nature is not “red in tooth and claw” (in this model). –The moths and their colors don’t compete with each other directly. –Colors confer survival value (fitness) depending on the environment. More like a race than a boxing match.

4 Traveling salesman problem (TSP) Connect the cities with a path that Starts and ends at the same city. Includes all cities. Includes no city twice. The obvious routes all include the sequence: ACED-54 (or its reverse). The question is where to put B: ABCED-55, ACBED-57, ACEBD-56. B B A A D D E E C C

5 Genetic algorithm Create a population of possible paths. AEBCD-59, ACBED-57, ADCBE-59, ACDEB-71, … In this case there are only 4! = 24 possible routes. Could examine them all. Usually that’s not possible. Repeat Select one or two tours as parents. Better tours are more likely to be selected. Generate offspring using genetic operators. (Re)combine two tours: ACBED-57 & ADCBE → ACBED-57. Exchange two cities: ACDEB-71 → ACBED-57 Reverse a subtour: ACBED-57 → AEBCD-59 Possibly mutate the result: ADCBE-59 → ACBDE-70 B B A A D D E E C C A second exchange solves the problem. ACBED-57 → ABCED-55