SEMINAR REPORT ON

SUBMITTED TO ER. RAJ KUMAR YADAV INSTITUTE OF ENGINEERING & TECHNOLOGY ELECTRONICS & COMM ENGINEERING BUNDELKHAND UNIVERSITY

SUBMITTED BY AKANKSHA VERMA B.TECH 4TH YR 07232005 ELECTRONICS & COMM ENGINEEERING BUNDELKHAND UNIVERSITY

GENETIC ALGORITHMS

BASIC DISCRIPTION
Genetic algorithm inspired by DARWIN THEORY about evolution.Algorithm started with a set of solution(represented by chromosomes) called population. solution from one population are taken and used to form a new population. This is motivated by a hope that new population will be better than old one. solution which are selected to form new solution (off spring)are selected according to their fitness.

 OUTLINE OF THE BASIC GENETIC ALGORITHM

chromosomes

A.START
Generate random population of n chromosomes.

B.FITNESS
Evaluate the fitness(x) of each chromosomes in the population.

C. NEW POPULATION
Create a new population by repeating following steps untill the new population is complete.

1. SELECTION

Select two parents chromosomes to form a population according to their fitness.

2. CROSSOVER
With a crossover probability crossover the parents to form a new offspring (children).

3. MUTATION
With a mutation probability mutuate new offspring at each locus (position in chromosome).

4. ACCEPTI NG
Place new offspring in a new population

REPLACE
Use new generated population for a further run of algorithm

TEST
If the end condition is satisfied a stop and return the best solution in current population.

 OVERVIEW
Cross over and mutation are the most important part of genetic algorithm.performance is influenced mainly by these two operators.

ENCODING OF CHROMOSOME

Chromosomes contain some information about solution which it represent. The most used way of encoding is a binary string.The chromosomes then could be look like this 5. Chromosome 1 - 1101100100110110 6. Chromosome 2 - 1101111000011110 Each chromosome has one binary string,each bit in this string can
represent some characterstic of the solution.

CROSSOVER

Crossover

Crossover selects genes from parent chromosomes and creats a new offspring.The simplest way how do this is to choose randomly some cross over point and everything before this point copy from a first parent and then everything after a crossover point copy from the second parent. Crossover look like this (- represent crossover point) Chromosome1- 11011 - 00100110110 Chromosome2- 11011 11000011110 Offspring 1 11011 - 1100001110 Offsping 2 11011 00100110110

MUTATION
Mutation changes randomly the new offspring. For binary encoding, we can switch a few randomly choosen bits from 1 to 0 to 0 to 1. Mutation can then be following Original offspring 1 1101111000011110

 Original offspring 2- 1101100100110110 Mutuated offspring 1- 1100111000011110 Mutuated offspring 2- 1101101100110110 Mutation depends on the encoding as well as crossover.

PARAMETERS OF GENETIC ALGORITHM

There are two basic parameters of genetic algorithms mutation probability crossover probability

A. CROSSOVER PROBABILITY
crossover probability say how often will be cross over performed if there is no crossover performed offspring is exact copy of parents, if there is crossover,offspring is made from part of parents chromosomes if crossover probability is 100% then all crossover made by offspring, if crossover probability is 0% then whole new generation is made from exact copies of chromosomes from old population(but it does not mean that the new generation is same)

B.MUTATION PROBABILITY

mutation probability says how often will be part of chromosomes mutated. If there is no mutation offspring is taken after crossover (or copy) without any changes, if mutation is performed,parts of chromosomes are changed if mutation probability is 100% then chromosems are changed if it is 0% then nothing is changed

APPLICATIONs
The applications of genetic algorithm are as following Automotive design Engineering design Robotics Trip, traffic & shipment routing Encryption & code breaking Computer aided molecular design Gene expression profiling

AUTOMOTIVE DESIGN

Using Genetic Algorithms to both design composite materials and aerodynamic shapes for race cars and regular means of transportation (including aviation) can return combinations of best materials and best engineering to provide faster, lighter, more fuel efficient.

ENGINEERING DESIGN

Getting the most out of a range of materials to optimize the structural and operational design of buildings, factories, machines, etc. is a rapidly expanding application of Gas, such uses as optimizing the design of heat exchangers, robot gripping arms, satellite booms, building trusses,

flywheels, turbines, and just about any other computer-assisted engineering design application..

ROBOTICS

Robotics involves human designers and engineers trying out all sorts of things in order to create useful machines that can do work for humans. GAs can be programmed to search for a range of optimal designs and components for each specific use, or to return results for entirely new types of robots that can perform multiple tasks and have more general application.

TRIP, TRAFFIC &SHIP ROUTING

New applications of a GA known as the "Traveling Salesman Problem" can be used to plan the most efficient routes and scheduling for travel planners, traffic routers and even shipping companies. The shortest routes for traveling. The timing to avoid traffic tie-ups and rush hours. Most efficient use of transport for shipping, even to including pickup loads and deliveries along the way.

ENCRYPTION & CODE BREAKING

On the security front, GAs can be used both to create encryption for sensitive data as well as to break those codes. Encrypting data, protecting copyrights and breaking competitors' codes have been important in the computer world.

 COMPUTER AIDED MOLECULAR DESIGN

The design of new chemical molecules is field of applied chemistry in both industry and medicine. GAs are used to aid in the understanding of protein folding, analyzing the effects of substitutions on those protein functions, and to predict the binding affinities of various designed proteins developed by the pharmaceutical industry for treatment of particular diseases. The same sort of GA optimization and analysis is used for designing industrial chemicals for particular uses.

GENE EXPRESSION PROFILING

The development of microarray technology for taking 'snapshots' of the genes being expressed in a cell or group of cells has been a boon to medical research. GAs have been and are being developed to make analysis of gene expression profiles much quicker and easier.