STIN3084-A192-GENETIC-ALGORITHM / ASSIGNMENTS

0 stars 0 forks source link

ASSIGNMENT 4 #4

Open azmanyasin opened 4 years ago

azmanyasin commented 4 years ago

INSTRUCTION

In this assignment, you will implement a simple genetic algorithm in Java with fitness-proportionate selection (roulette-wheel sampling), population size 20, single-point crossover rate pc = 0.7, and mutation rate pm = 0.001 (using swap and replacement method). Perform 50 runs, and measure the average generation at which the chromosome of all NOT duplicated is discovered. Perform the same experiment with crossover turned off (pc = 0). If it turns out that mutation with crossover is better than mutation alone, why do you think that is the case? Do similar experiments, systematically varying the mutation and crossover rates, and population size, to see how the variations affect the average time required for the GA to find the optimal chromosome.

SUBMISSION

  1. Java code
  2. Output
  3. Due date 25 July 2020
wilsonkhor1997 commented 4 years ago

If crossover rate equal 0, there is no more Crossover Method will be perform. Hence, there will not perform an outstanding result compare mutation alone. If the mutation rate is smaller than 0.1, Mutation Method also will not be perform in the program. If the number of crossover rate and population size is smaller, the average time required for the GA to find the optimal chromosome will be faster.

https://github.com/wilsonkhor1997/GA-Assignment/issues/4#issue-660680818

aizathakimi97 commented 4 years ago

ASSIGNMENT 4.zip

abraranuar commented 4 years ago

GENETIC ALGORITHM STIN3084 A192 259231 ass4.zip

Jayyijianyi commented 4 years ago

FourReplacement.zip FourSwap.zip