Difficulties - canonical genetic algorithm, Computer Engineering

Assignment Help:

Difficulties - canonical genetic algorithm:

Therefore the first big problem we face whether designing an "AI" agent to perform a GA-style search is how to represent the solutions. Whether the solutions are textual through nature, so then ASCII strings utilizing eight bits per letter means the size of individuals can get very large. Because of evolution may take thousands of generations to converge onto a solution. Conversely there will be much redundancy in the bit string representations also as: in generally many bit strings produced through the recombination process will not represent solutions at all, like in e.g., they may represent ASCII characters that shouldn't appear in the solution. Whether in the case of individuals that don't represent solutions and how do we measure these with the evaluation function? Further it doesn't necessarily follow like they are entirely unfit, means the tweaking of a single zero to a one might make them good solutions. However the situation is better where the solution space is nonstop or the solutions represent real valued numbers or integers. Hence the situation is worse whereas there are only a finite number of solutions.

But the second big problem we face is how to simplify the evaluation function because this is crucial to the success of the GA experiment. Hence the evaluation function should, whether possible as like:

  •  There return a real-valued number scoring higher for individuals that perform better with respect to the problem
  •  Other is be quick to calculate, as this calculation will be done many thousands of times
  •  Separate well between different individuals, like as give a good range of values even with a well doing in specified evaluation function,

whether populations have evolved to a certain stage so it is possible to the individuals will all score highly with respect to the evalation function hence all have equal chances of reproducing. In fact in this case, evolution will effectively have stopped plus it may be necessary to take some action to spread them out just to make the evaluation function more difficult dynamically, possibly.


Related Discussions:- Difficulties - canonical genetic algorithm

Gralands robots, You have been contacted by Jean-Luc Picard commanding offi...

You have been contacted by Jean-Luc Picard commanding officer of Star Trek: The Next Generation. The Commander needs your support to develop a software routine to simulate the Robo

Research methods, Building on their knowledge of research methods and their...

Building on their knowledge of research methods and their interest in a particular aspect of information technology this assessment enables students to put this knowledge into prac

Explain the different sub-functions of process scheduling, Explain the diff...

Explain the different sub-functions of Process Scheduling. Process scheduling contains the subsequent sub-functions: 1. Scheduling: Chooses the process to be executed next

Coso framework, The COSO Framework consists of six broad classes of control...

The COSO Framework consists of six broad classes of control activities. Initial responses should identify and define one of the broad classes (Ex: segregation of duties or indepe

Cemistry, Discuss scales and sludge

Discuss scales and sludge

What is digital switch, Digital switch It is a device that handles digi...

Digital switch It is a device that handles digital signals formed at or passed by a telephone company's central office and sends them across the company's backbone network.

Explain about the links and association, Links and Association Links a...

Links and Association Links and associations are the basic means used for establishing relationships among objects and classes of the system. In the next subsection we will di

How adaptive transmission helps tcp to maximize connection, How adaptive tr...

How adaptive transmission helps TCP to maximize throughput on each connection? To know how adaptive retransmission helps TCP maximize throughput upon all connection, see a case

Explain the odd-even transposition algorithm, Q. Explain the odd-even trans...

Q. Explain the odd-even transposition algorithm? The algorithm needs one 'for loop' beginning from I=1 to N it implies that N times and for every value of I, one 'for loop' of

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