Dr. Unnikrishnan P.C. Professor, EEE

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Bio-Inspired Optimization. Our Journey – For the remainder of the course A brief review of classical optimization methods The basics of several stochastic.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Chapter 4 DECISION SUPPORT AND ARTIFICIAL INTELLIGENCE
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
Evolutionary Computation Introduction Peter Andras s.
Genetic Algorithms Learning Machines for knowledge discovery.
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
7/2/2015Intelligent Systems and Soft Computing1 Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Pawel Drozdowski – November Introduction GA basics Solving simple problem GA more advanced topics Solving complex problem Question and Answers.
Genetic Algorithms: A Tutorial
Genetic Algorithm.
Evolutionary Intelligence
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Genetic algorithms Prof Kang Li
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Fuzzy Genetic Algorithm
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Soft Computing A Gentle introduction Richard P. Simpson.
© Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
 Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms n Introduction, or can evolution be intelligent? n Simulation.
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
In the name of ALLAH Presented By : Mohsen Shahriari, the student of communication in Sajad institute for higher education.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
A field of study that encompasses computational techniques for performing tasks that require intelligence when performed by humans. Simulation of human.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
Genetic Algorithms. Solution Search in Problem Space.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Genetic Algorithms.
Introduction to Genetic Algorithms
Genetic Algorithms.
Optimization Of Robot Motion Planning Using Genetic Algorithm
Soft Computing Basics Ms. Parminder Kaur.
Evolutionary Technique for Combinatorial Reverse Auctions
Artificial Intelligence Methods (AIM)
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Introduction to Genetic Algorithm (GA)
Chapter 6: Genetic Algorithms
Intelligent Systems and Soft Computing
Advanced Artificial Intelligence Evolutionary Search Algorithm
Basics of Genetic Algorithms (MidTerm – only in RED material)
Biological Bases of Behavior Northwest High School
Genetic Algorithms: A Tutorial
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult.
EVOLUTION Adapting to change!.
GENETIC ALGORITHMS & MACHINE LEARNING
Basics of Genetic Algorithms
Searching for solutions: Genetic Algorithms
CHAPTER I. of EVOLUTIONARY ROBOTICS Stefano Nolfi and Dario Floreano
A Gentle introduction Richard P. Simpson
Traveling Salesman Problem by Genetic Algorithm
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Evolution proceeds inevitably from simple toward the more complex
Beyond Classical Search
Genetic Algorithms: A Tutorial
Presentation transcript:

Dr. Unnikrishnan P.C. Professor, EEE EE368 Soft Computing Dr. Unnikrishnan P.C. Professor, EEE

Module V Genetic Algorithms

Introduction One of the central challenges of computer science is to get a computer to do what needs to be done, without telling it how to do it.

History

Motivation & Necessity Nature is the motivation. Nature automatically finds out the best, fittest individual from a species those who are likely to survive more easily than others. Exactly the same way we can find out the best solutions among a no of solutions by using GA from a given search space for a specific Problem.

Motivation & Necessity NECESSITY: Often we need a search or an optimization process which- 1) Can deal with complex multidimensional discontinuous problem.. 2) Is easy and efficient to find global maxima or minima. 3) Faster. 4) Can be implemented by computer. 5) Can be used in Huge search space defined for those variables. GA satisfies the following criterias.

Introduction • The only intelligent systems on this planet are biological. • Biological intelligences are designed by natural evolutionary processes. • They often work together in groups, swarms, or flocks. • They don't appear to use logic, mathematics, complex planning, complicated modeling of their environment. • They can achieve complex information processing and computational tasks that current artificial intelligences find very challenging indeed.

NATURAL INSPIRED COMPUTING • In other words Biologically Inspired Computing. • Biological organisms cope with the demands of their environments. • They uses solutions quite unlike the traditional human engineered approaches to problem solving. • They exchange information about what they’ve discovered in the places they have visited. • Bio-inspired computing is a field devoted to tackling complex problems using computational methods modeled after design principles encountered in nature.

Classical Computation Vs Bio-Inspired Computation • Classical computing is good at: • Number-crunching • Thought-support (glorified pen-and-paper) • Rule-based reasoning • Constant repetition of well-defined actions. • Classical computing is bad at: • Pattern recognition • Robustness to damage • Dealing with vague and incomplete information; • Adapting and improving based on experience

Classical Computation Vs Bio-Inspired Computation • Bio-inspired computing takes a more evolutionary approach to learning. • In traditional AI, intelligence is often programmed from above. The Programmer create the program and imbues it with its intelligence. • Bio-inspired computing, on the other hand, takes a more bottom-up, decentralized approach. • Bio-inspired computing often involve the method of specifying a set of simple rules, a set of simple organisms which adhere to those rules.

Genetic Algorithm-Evolution

Genetic Algorithm-Evolution • Each species try to adapt with the gradually changing environment on the earth. • The knowledge that each species gains is encoded in its chromosomes automatically, which undergoes transformations when reproduction occurs. • Over a period of time, these changes to the chromosomes give rise to more fit species that are more likely to survive, and so have a greater chance of passing their improved characteristics on to future generations. • Otherwise the species may extinct. • Genetic Algorithm is search Heuristic that mimics the process of natural evolution and helps us to find out the fittest solution of a problem exactly the same way simulating selection, crossover, mutation etc. • Often used in optimization and search problems.

Evolution In The Real World • Each cell of a living thing contains chromosomes - strings of DNA. • Each chromosome contains a set of genes - blocks of DNA. • Each gene determines some aspect of the organism (like eye colour). • A collection of genes is sometimes called a genotype. • A collection of aspects (like eye characteristics) is sometimes called a phenotype.

Evolution In The Real World • Reproduction involves recombination of genes from parents and then small amounts of mutation (errors) in copying. • The fitness of an organism is how much it can reproduce before it dies. • Evolution based on “survival of the fittest”.