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

What is analysis iteration, Analysis Iteration   To understand any prob...

Analysis Iteration   To understand any problem completely you have to repeat task which implies that analysis requires repetition. First, just get overview of problem, make a r

What is importance of xml into edi and electronic commerce, What is the imp...

What is the importance of XML into EDI and electronic commerce? XML has been explained as lightweight SGML: XML demonstrates great promise for its inherent capability to per

What are called stalls, What are called stalls? An alternative represen...

What are called stalls? An alternative representation of the operation of a pipeline in the case of a cache miss gives the function performed by every pipeline stage in each cl

Propositional inference rules - artificial intelligence, Propositional Infe...

Propositional Inference Rules -Artificial intelligence : Equivalence rules are specifically useful because of the vice-versa aspect,that means we can discover forwards andbackw

Computer architecture, Explain division and its restoring and non-restoring...

Explain division and its restoring and non-restoring techniques?

What is net-fu and where is it?, Net-fu is a web-based interface to a scri...

Net-fu is a web-based interface to a script-fu server. The work is completed at a remote site. To see Net-fu, point your web browser or one of the mirror sites, and then go to "gim

Convert the following into pos form, Q. Convert the following into POS form...

Q. Convert the following into POS form 1.  (AB + C + DC)(AB + BC + D) 2.  WYZ + XYZ + W'X'Y + W'XYZ 3.  XY + XZ + X'YZ' 4.   (A+B'+C) (AB+AC') 5.   F(A,B,C,D)=M(0,3,

Specifying research problems, Specifying Research Problems: In our age...

Specifying Research Problems: In our agent terminology or in technique history, a problem to be solved is a specific and justified manner where the agent has starts with the b

Implementation for the prime machine, Write an implementation for the Prime...

Write an implementation for the Prime machine (de?ned at the end of the assignment sheet). Provide a suitable invariant and variant for any loop you use. Provide comments in your m

In order to concatenate strings only for output purposes, In order to conca...

In order to concatenate strings only for output purposes which command can be used in conjunction with the 'Write' statement. NO-GAP command.

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