Classical approach - canonical genetic algorithm, Computer Engineering

Classical approach - Canonical genetic algorithm:

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.

After then, in the standard approach to GAs, called as the canonical genetic algorithm where the first stage is to generate an initial random population of bit strings of length L. Through random selection here means that the ones and zeros in the strings are chosen at random. Therefore sometimes, not often that the initialization procedure is done by a little more intelligence, as in e..g., utilizing some additional knowledge just about the domain to choose the initial population. 

Just after the initialization step then the canonical genetic algorithm proceeds iteratively utilizing selection, mating, and recombination processes and then checking for termination.

In such a scenario the next section where we look in detail that at how individuals are selected, mated, recombined as and mutated for good measure. Through termination of the algorithm may occur whether one or more of the best individuals in the current generation performs well enough with respect to the problem, according this performance specified through the user.

Posted Date: 1/12/2013 6:07:44 AM | Location : United States







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

Write discussion on Classical approach - canonical genetic algorithm
Your posts are moderated
Related Questions
Choose the descriptions below with the most appropriate memory management scheme (A through D).  Solutions may be used once, more than once, or not at all. A.     Fixed-partitio

Explain any three policies for process scheduling that uses resource consumption information. All three policies for process scheduling are explained below in brief: 1. Fi

Fuzzy set theory provides a means for modeling the kind of uncertainty associated with vagueness, with imprecision, and/or with a lack of information regarding a particular element

What are the advantages of using XML over HTML?  The root cause of the problem lies in HTML (Hyper Text Mark-up Language), the defacto standard for web publication. The main pr

Q. How can we use Metropolitan Area Network? A MAN, essentially a bigger versions of a LAN is designed to extend over an entire city. It may be single network like a cable tele

can i get the comparison of microprocessors architecture?

Explain in detail about Operating Systems (OS) Operating system (OS) is a program which after being initially loaded into computer by a boot program, manages all the other appl

We also need to know, given a cell, which of its neighbours has all of its walls intact. Write the function wallsintact that accepts the grid and a list of neighbouring cells and r

What are the two independent mechanisms for controlling interrupt request? At the device end, an interrupt enable bit in a control register verifies whether the device is permi

Q. Show the Features of Hyper-threading? The significant characteristics of hyper threading are: i) Improved response time and reaction, as well as increased number of users