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

Perfect fundamental logic - artificial intelligence, Perfect fundamental lo...

Perfect fundamental logic - artificial intelligence: However, while it's theoretically  possible to do definite intelligent things (like prove some easy mathematics theorems a

Example on cyclic distribution of data, Q. Example on Cyclic Distribution o...

Q. Example on Cyclic Distribution of data? !HPF$ PROCESSORS P1(4) !HPF$ TEMPLATE T1(18) !HPF$ DISTRIBUTE T1(CYCLIC) ONTO P1 The result of these instructions is display

What is a heap, What is a heap? A complete binary tree, every of whose ...

What is a heap? A complete binary tree, every of whose elements contains a value that is  greater than or equal to the value of every of its children is known a Heap

Optical resolution of scanner, Optical resolution or hardware resolution is...

Optical resolution or hardware resolution is mechanical limit on resolution of Scanner. For scanning the sensor has to advance after every line it scans. Smallness of this advancem

Design principles, The usability and user experience goalsprovidet heintera...

The usability and user experience goalsprovidet heinteraction designer with high-level goals for the interactivep roduct. Thenextissueis how to design a product that satisfies thes

What is inode, What is 'inode'? All UNIX files have its description kep...

What is 'inode'? All UNIX files have its description kept in a structure called 'inode'. The inode have info about the file-size, its location, time of last access, time of las

Illustrate the purchase consummation activity, Illustrate the Purchase Cons...

Illustrate the Purchase Consummation activity? Purchase Consummation: This model lists three activities in the purchase consummation phase: • Receipt of product. • Pl

Explain Not recently used page replacement algorithm, Not Recently Used Pag...

Not Recently Used Page Replacement Algorithm The not recently used abbreviated as NRU page replacement algorithm works on the subsequent principle: while a page is referenced,

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