Genetic Algorithms: Choosing a Fitness Function

ashmai
Messages
2
Reaction score
0
Does anyone know of a good fitness function for evaluating an animal characteristic in genetic algorithms?
I'm doing a project. The prompt is: Select some features of an actual organism and design a genetic algorithm together with a reasonable fitness landscape to evolve the organism in time.
I'm using the Matlab genetic algorithms toolbox, but can't think of a good organism characteristic that has an interesting fitness function. I can do anything, like bird beak length, elephant ear radius, etc... I just need a good way to evaluate how the possible genotypes will survive - thus, I need a good fitness function! Maybe from literature?
 
Mathematics news on Phys.org
There are two possibilities:

1) The characteristic you picked is always better to have more of. FOr example, you might argue the longer the bird beak the better, and that's that. Then a fitness function like f(length)=length or f(length) = 1-1/(length) would work

2) It can be bad for it to be too big. For example if the beak's length is too long maybe the bird can't fly around anymore. So the fitness function is a quadratic function fitness = length*(10-length).

Obviously I can't be sure without knowing what the rest of your project says but when they say 'reasonable function' it sounds more like they just want you to pick a function that sounds pretty good rather than actually calculating one from empirical data
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top