Discrete Optimization - Genetic Algorithms

kikitard
Messages
5
Reaction score
0

Homework Statement


I have a whole two courseworks on Genetic Algorithms, but we have been shown no examples. I am stumped!

1. A function f is set to depend on five variables x1, . . . , x5 where x1 can take 2 different
values, x2 can take 8 different values and x3, x4, x5 each take 4 different values. Design
a minimal binary coding for x1, . . . , x5, i.e. what would a chromosome look like which
encodes these five numbers? What is the maximal number of settings represented by
chromosomes coded this way? What is the number of schemata in this encoding?

This is the very first question.

Homework Equations


Nothing, sorry!

The Attempt at a Solution


I wish I knew where to begin!
 
Physics news on Phys.org
Welcome to PF!

These are very basic questions in genetic algorithms, so my guess is that you are supposed to read up on the subject matter before you can understand what is being asked. Surely you must have been given some textbooks or similar that explains this? And even without such, a quick search for "genetic algorithm" on the net should provide you with enough clues and examples. Have you made such (re-) search?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top