Explore BrainMass

Genetic Algorithm with Mutation

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

A genetic algorithm uses the following mutation operator: the bits in the input string are considered one by one independently, with probability 0.01 that each bit is inverted.

Given that you apply the mutation operator to the string (0 0 0 0), what is the probability that the output is:

(0 0 0 0)?

(0 1 0 0)?

(1 0 1 0)?

(1 1 1 1)?

Show the process of your computation.

© BrainMass Inc. brainmass.com March 21, 2019, 10:46 pm ad1c9bdddf

Solution Preview

As background, if events A and B are independent, then the chance the A and B both happen is P(A)*P(B).

In this problem, we are told that each input bit is considered independently, and has a 0.01 chance of being flipped. So for example, the chance that '0' would ...

Solution Summary

This solution shows how to calculate the probability of a certain output for a genetic algorithm with a mutation operator.