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

Show layout 84-key keyboards, Q. Show layout 84-key Keyboards? PC 83-ke...

Q. Show layout 84-key Keyboards? PC 83-key was the earliest keyboard provided by IBM with its first Personal Computers (PC). This had 83 keys. Afterwards IBM added one more key

Explain the relationship b/w translated & load time address, Explain the re...

Explain the relationship amongst Translated address and Load time address. Translated address: Address assigned through the translator Load time address: Address ass

Explain the main characteristics of semiconductor memory, Explain the Main ...

Explain the Main characteristics of semiconductor memory Memory, with regard to computers, most commonly signifies to semiconductor devices whose contents can be accessed (whic

What are the major functions of io system, What are the major functions of ...

What are the major functions of IO system?  i. Interface to the CPU and memory by the system bus.  ii. Interface to one or more IO devices by tailored data link.

Classified the vlsi technology, The VLSI technology is still developing. Mo...

The VLSI technology is still developing. More and more powerful microprocessors and more storage space now are being put in single chip. One question that we have still not conside

Determine by which final selector is connected, The final selector is conne...

The final selector is connected to the (A) calling subscriber.                     (B) switching network. (C) called subscriber.                      (D) li

Computer Architecture, As an advocate of CISC architecture to RISC architec...

As an advocate of CISC architecture to RISC architecture, what are the merits and demerits of CISC to RISC architecture

Determine the minimal sum of products for boolean expression, Determine the...

Determine the Minimal sum of products for the Boolean expression? Obtain the minimal sum of products for the Boolean expression f=(1,2,3,7,8,9,10,11,14,15) using Quine-McCluske

Convert the decimal number into its equivalent binary number, Write a progr...

Write a program to convert the given Decimal number into its equivalent Binary number.

Explain optimizing transformations, Explain optimizing transformations? ...

Explain optimizing transformations? Optimizing transformations: It is a rule for rewriting a segment of a program to enhance its execution efficiency without influencing i

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