added another steepest accent hill climber to experiment runner and
increased all the runs to 10000
h
We created IteratedLocalSearchRandomRestarts.groovy (cloned from
HillClimber.groovy) then updated the algorithm to perform iterated
local searches.
Wrote RandomSearch
Made the populationMethods package, Created the Algorithm19 class,
started the algorithm
Initial creation
Added HillClimberWithRandomRestarts (algorithm 10) under
singleStateMethods
Wrote most/all of the algorithm
generated the list of individuals, calculated the best, and now are
working on sorting/taking the m best individuals
added algorithm 30
basic version of iterated local search is working. Updated
bitstringproblem to allow for intermediate time, perturb, and
newhomebase. OnesMax increments intermediate time.
It seems that SinglePointCrossover works and has a working test!
Test for SinglePointCrossover
Finished the Generation-pass-on calculations (sorted the set and took
mu of the first in the sorted, added to individualArr)
Finished implementation and did refactoring
TwoPointCrossover and its test should be good to go!
Two point crossover and its test should be good to go
Ran tests, Feel like there may be some wierdness with our code (will
consult nic) however feel as though it is working soundly.
All the crossovers should be done
COMMENTED A LINE OUT