Canonical genetic algorithm - artificial intelligence, Computer Engineering

Canonical Genetic Algorithm:

In such a scenario with all search techniques there one of the first questions to ask along with GAs is how to define a search space that is actually potentially contains good solutions to the problem at hand. Because answering the question of how to represent possible solutions to the problem. But there the classical approach to GAs is to represent the solutions as strings of ones and zero as there in example, bit strings. Further this is not such a bad idea that given to computers store everything as bit strings so then any  solution would ultimately boil down to a string of ones and zeros. Moreover,, there have been many modifications to the original approach to genetic algorithms so and GA approaches here now come in many different shapes and sizes like on higher level representations. Definitely it's possible to see genetic programming, whether the individuals in the population are programs in such a scenario just a GA approach with a more complicated representation scheme. 

However returning to the classical approach, as there example, whether solving a particular problem involved finding a set of five integers between 1 and 100 after then the search space for a GA would be bits strings when the first eight bits are decoded as the first integer so the next eight bits become the second integer and so on. Therefore representing the solutions is one of the tricky parts to using genetic algorithms hence a problem we come back to later. Thus by assuming that the solutions are represented such as strings of length L.

Posted Date: 1/12/2013 6:06:17 AM | Location : United States







Related Discussions:- Canonical genetic algorithm - artificial intelligence, Assignment Help, Ask Question on Canonical genetic algorithm - artificial intelligence, Get Answer, Expert's Help, Canonical genetic algorithm - artificial intelligence Discussions

Write discussion on Canonical genetic algorithm - artificial intelligence
Your posts are moderated
Related Questions
Q. Show MPI functions? MPI comprises hundreds of functions which are a small subset of which is enough for most practical purposes. We will discuss some of them here. Int M

Q. Show the spawned program? include "pvm3.h"  main() {    int ptid, msgtag;    char buf[100];    ptid = pvm_parent();    strcpy(buf, "hello, world from ");

Simple codes for robot using applet

Draw and illustrate the block diagram of DMA controller. Also discuss the various modes in which DMAC works. Direct memory access (DMA) is a process in that an external device

Interrupt handling: Handling Interrupts  Several  situations where the processor should avoid interrupt requests Interrupt-enable Interrupt-disable  Typical

What is the Network Service Access Policy A high-level, issue-specific policy which defines those services that are allowed or denied from the restricted network. It also co


Explain The Boolean Equations for Logic Circuits? A Boolean equation is the mathematical representation of a logic circuit using standard Boolean terms. All the logic gates (AND,

Q. High Level Language Program Characteristics? So it is clear that new architectures must support high-level language programming. A high-level language system can be implemen

How can we change almost any algorithm to have a good best case running time? Check whether the input constitutes an input at the very starting Or else run the original algo