Difficulties - canonical genetic algorithm, Computer Engineering

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.

Posted Date: 1/12/2013 6:22:33 AM | Location : United States







Related Discussions:- Difficulties - canonical genetic algorithm, Assignment Help, Ask Question on Difficulties - canonical genetic algorithm, Get Answer, Expert's Help, Difficulties - canonical genetic algorithm Discussions

Write discussion on Difficulties - canonical genetic algorithm
Your posts are moderated
Related Questions
What is a switchboard A switchboard is only a form with command button that open other switchboard or perform tasks like opening forms and printing reports. Switchboard is a t

Q. Determine the complete OR gate and AND gate decoder count for an IC memory with 4096 words of 1 bit each, using the Linear select memory organization and Two dimensional Memory

What are the various mechanisms for implementing I/O operations? a) Program controlled I/O b) Interrupts c) DMA

how to calculate students''s averange test scores

Q. Illustrate Shift Micro-operations? Shift is a valuable operation that can be used for serial transfer of data. These operations can also be used along with other (arithmetic

Control Dependence Segments or Instructions in a program can include control structures. So, dependency among statements is able to be in control structures also. However the

Conversion of decimal number 10.625 into binary number ? Ans. There is integer part is 10 and fractional part is 0.625. Firstly convert the decimal number 10 in its equal bina

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

what are the questionnaries and observation of work site for banking system?

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