Fitness function - canonical genetic algorithm, Computer Engineering

Assignment Help:

Fitness function - canonical genetic algorithm:

Conversely the fitness function will use an evaluation function to calculate a value of worth for the individual accordingly that they can be compared against each other. Frequently the evaluation function is written g(c) for a particular individual c. hence correctly specifying such evaluation functions is a risky job that we look at later. However the fitness of an individual is calculated through dividing the value it gets for g with the average value for g over the entire population as: 

Here fitness(c) = g(c)/(average of g over the entire population)

Therefore we see that every individual has at least a chance of going with the intermediate population unless they score zero for the evaluation function. In fact as an example of a fitness function requiring an evaluation function, assume our GA agent has calculated the evaluation function for every member of the population plus the average is 17. After then, for a particular individual c0, the value of the evaluation function is 25. Moreover the fitness function for c0 would be calculated as 25/17 = 1.47. Because, one copy of c0 will definitely be added to the IP  plus one copy will be added with a probability of 0.47 as in e.g., a 100 side dice is thrown and only if it returns 47 or less so there is another copy of c0 added to the IP.


Related Discussions:- Fitness function - canonical genetic algorithm

Explain complex instruction set computer, CISC (Complex Instruction Set Com...

CISC (Complex Instruction Set Computer) CISC stands for Complex Instruction Set Computer. If the control unit having a number of micro-electronic circuitry to make a set of con

Storage devices, Logic manufactures have produced 'large scale' logic (LSI)...

Logic manufactures have produced 'large scale' logic (LSI) blocks to achieve complex functions; a typical set of logic functions is that of data storage. There are two main types o

Methods for organising the associative memory, There are two methods for or...

There are two methods for organising the associative memory based on bit slices: Bit parallel organisation: In this organisation every bit slices which are not masked off,

Pythagorean theorem, if the 6 is a and the b is 3 what is the c ?

if the 6 is a and the b is 3 what is the c ?

Need of the assembly language, Q. Need of the assembly language ? Machi...

Q. Need of the assembly language ? Machine language code comprises the 0-1 combinations which computer decodes directly.  Though the machine language has the following problems

user to enter the weight, A red and blue car were involved in a head-on co...

A red and blue car were involved in a head-on collision. The red car was at a standstill and the blue car was possibly  speeding. Eye witness video recorded suddenly following the

What is linear bounded automation, What is linear bounded automation?  ...

What is linear bounded automation?   A linear bounded automation is restricted type of Turing machine where in the tape head isn't permitted to move off the portion of the tape

Data structure, Sort the following list using selection sort technique, dis...

Sort the following list using selection sort technique, displaying each step. 20,12,25,6,10,15,13

Ground substitution, Ground substitution: Here the act of performing a...

Ground substitution: Here the act of performing an instantiation is a function like there is only one possible outcome means we can write it as a function. And the notation Su

What is co-operative process, What is co-operative process? A process i...

What is co-operative process? A process is co-operating if it can affect or be affected by the other processes implementing in the system. Any process that share data with othe

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd