Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.

Slides:



Advertisements
Similar presentations
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)
Advertisements

Exact and heuristics algorithms
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
CHAPTER 9 E VOLUTIONARY C OMPUTATION I : G ENETIC A LGORITHMS Organization of chapter in ISSO –Introduction and history –Coding of  –Standard GA operations.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Section 14.5: Local search – Genetic Algorithms.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Genetic algorithms for neural networks An introduction.
Introduction to Genetic Algorithms Yonatan Shichel.
COMP 578 Genetic Algorithms for Data Mining Keith C.C. Chan Department of Computing The Hong Kong Polytechnic University.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Design of Curves and Surfaces by Multi Objective Optimization Rony Goldenthal Michel Bercovier School of Computer Science and Engineering The Hebrew University.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Brandon Andrews.  What are genetic algorithms?  3 steps  Applications to Bioinformatics.
Genetic Algorithm.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
Solving the Concave Cost Supply Scheduling Problem Xia Wang, Univ. of Maryland Bruce Golden, Univ. of Maryland Edward Wasil, American Univ. Presented at.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
HOW TO MAKE A TIMETABLE USING GENETIC ALGORITHMS Introduction with an example.
Optimal resource assignment to maximize multistate network reliability for a computer network Yi-Kuei Lin, Cheng-Ta Yeh Advisor : Professor Frank Y. S.
Introduction to GAs: Genetic Algorithms How to apply GAs to SNA? Thank you for all pictures and information referred.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Genetic Algorithms K.Ganesh Reasearch Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute of Technology.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
Optimal Placement of Wind Turbines Using Genetic Algorithms
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Neural Networks And Its Applications By Dr. Surya Chitra.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
►Search and optimization method that mimics the natural selection ►Terms to define ٭ Chromosome – a set of numbers representing one possible solution ٭
Genetic Algorithms. Overview “A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining.
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.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithm(GA)
Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Advanced AI – Session 7 Genetic Algorithm By: H.Nematzadeh.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Genetic Algorithm (Knapsack Problem)
Using GA’s to Solve Problems
Bulgarian Academy of Sciences
Genetic Algorithms CPSC 212 Spring 2004.
CS621: Artificial Intelligence
EE368 Soft Computing Genetic Algorithms.
Boltzmann Machine (BM) (§6.4)
Genetic algorithms: case study
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Presentation transcript:

Non-Linear Problems General approach

Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective is to minimize cost or maximize benefits minus costs usually have cost functions with economies of scale. This implies a non-linear function

Non-linear Optimization Various approaches exist for solving non- linear problems. One of these is to divide the nonlinear functions into several linear sections (piecewise linearization). Another approach would be Genetic Algorithms

GA It is robust and computationally efficient for many types of problems, especially those that are highly nonlinear It is based on Theory of Evolution

GA Steps Step 1: Population Generation: A population of n chromosomes (i.e., individuals) is generated by randomly selecting values for the genes in the chromosomes. (I.e., randomly assign values to the decision variables for each of a large number of alternatives.) Step 2: Fitness Evaluation: Evaluate the “fitness” of each chromosome in the population. (I.e., calculate the value of the objective function for each alternative.) Step 3: Test for Completion: Test to see if an end condition has been achieved (e.g., test to see if a maximum number of generations has been reached, etc.). If so, stop. If not, continue with the next step.

Step 4: Create a New Population: Apply the processes of selection, crossover, mutation, and replacement to build a new population. – Step 4a: Selection: Select two parent chromosomes from the present population according to their fitness: the greater the fitness of an individual, the greater is the chance that the individual will be selected to be a parent and produce offspring. (I.e., select two alternatives from the current collection of alternatives, and base that selection upon the value of the objective function of the current alternatives.) – Step 4b: Crossover: With a pre-selected probability, select genes from one parent or the other to form a new individual (i.e., to form an offspring). (I.e., use some of the decision variable values from one of the alternatives, and some from the other, to formulate a new alternative.) – Step 4c: Mutation: With a pre-selected probability, cause a mutation to happen at any given gene in the new individual (i.e., make a small change in the value of a randomly selected decision variable). (I.e., make small, random changes in the values of some of the decision variables of the new alternative.)

Selection Process

Crossover Process

Mutation Process Example