• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 512
  • Last Modified:

Fitness Function for a Genetic Algorithm

  I'm currently revising for an A.I exam and so am spending some time going through some past exam papers to try and work out the kind of questions which are likely to come up. One of the questions from last year's paper has me completely stuck though :o( I have read through the lecture notes, and the relevant chapter in the textbook but still cannot make any sense of it. The question is number 3 on the following paper :-


Please, if any could explain how this works I would be immensely grateful, i've been struggling with it all day to no avail!

Thanks in advance

1 Solution
Each survivor is a candidate for survival to the next generation, along with
any new chromosome produced....If the mutant is different from any candidate accumulated so far, that
mutant is added to the candidates.The chromosome with the highest score survives to the next generation.

qualities according to a matrix:
survivers mutants
{1,1}1 {2,1}2
{1,2}2 {2,2}3
{1,3}3 {1,4}4

note that all genes are better ;)

"If the mutant is different from any candidate accumulated so far, that
mutant is added to the candidates" => all mutants added to candidates
MrChartWarsAuthor Commented:
Ok, thanks for your help :o) So are you saying that {1,3}, {2,2}, {1,4} and either {2,1} or {1,2} will be the four that go through to the next generation?


Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

Join & Write a Comment

Featured Post

Cloud Class® Course: Amazon Web Services - Basic

Are you thinking about creating an Amazon Web Services account for your business? Not sure where to start? In this course you’ll get an overview of the history of AWS and take a tour of their user interface.

Tackle projects and never again get stuck behind a technical roadblock.
Join Now