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 are various ids associated with a process, What are various IDs associ...

What are various IDs associated with a process? Unix identifies each process with a unique integer known as ProcessID. The process that implements the request for creation of a

Operating systems, Consider the state transition diagram of Figure 3.9b . S...

Consider the state transition diagram of Figure 3.9b . Suppose that it is time for the OS to dispatch a process and that there are processes in both the Ready state and the Ready/S

Web services method, Why cant datareader be returned from a Web Services Me...

Why cant datareader be returned from a Web Services Method? Ans) Because datareader is not serializable.

Determine condition how the output changed of JK flipflop, The output of a ...

The output of a JK flipflop with asynchronous preset and clear inputs is '1'. The output can be changed to '0' with which conditions ? Ans. Through applying J = 1, K = 1 and u

Write policy of cache memory, Q. Write Policy of cache memory? If conte...

Q. Write Policy of cache memory? If contents of a block in cache are changed then it's essential to write it back to main memory before replacing it. Write policy determines wh

Mac is the abbreviation for which type of control, MAC is the abbreviation ...

MAC is the abbreviation for: (A) Multimedia access control (B) Media access control (C) Mobile access control       (D) Master access point control Ans: MAC is th

Why we use addressing schemes, Q Why we use addressing schemes? An ope...

Q Why we use addressing schemes? An operation code of an instruction tells the operation to be performed. This operation is executed on some data stored in memory or register.

?????, c program??????????

c program??????????

Resolution method - artificial intelligence, Resolution Method - Artificial...

Resolution Method - Artificial intelligence: A minor miracle happened in 1965 when Alan Robinson published his resolution function. This function uses a generalized format of t

Function name or connective symbol, Function name or connective symbol: ...

Function name or connective symbol: Whether if we write op(x) to signify the symbol of the compound operator then predicate name and function name or connective symbol are the

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