As you can see, Freewill now supports 17 different selection policies. At this point, all of them are coded but only half of them have been tested.
The 11 available termination policies are coded, half of them tested.
So far, only 2 mutation policies are available. Both of them are coded and tested. I will probably need a few extras for TSP type of problems as well as numerically parametrized problems (e.g. De Jong functions with a domain for each variable). I’ll probably add 3-4 other ones specific to the problem that started all this adventure!
Only one immigration policy (no immigration!) is available and it will stay that way for a long time. I’ll wait until I am hyper confident that this framework is rock solid before introducing parallelism and exchange of individuals between « islands » (i.e. simulations). This one is a faaaaaaar away!
Six crossover policies are available as of now . This area will require some (minor I think at first glance) changes for the TSP type of problems : not quite decided on the approach I will take to solve this. Since crossover is often very problem/chromosome specific, I’ll probably delay those change until the end, once I have all examples coded and ready to be tested to have a better idea of what is needed. But I will definitely add a few (3-4) crossover policies tailored for the Ruzzle problem.
I have solved the discrepancy (see here and here) between my results and the TSPLIB ones regarding the tour length of the Burma14 problem. Will probably add a lot bigger TSP problem to see how the framework can handle an extremely huge search space! Oh! And I need to clean up all the crap I added/modified while looking for the problem of « distance difference » : 2 classes were butchered in the process!
I need to add a few « crash test dummy » classes to test all those different selection policies (and crossover) in a simpler and more efficient manner! Or I should kick myself in the %*&#$!@ and code the « bits » example classes…
I will soon work on a customizable display of statistics. All that’s needed is already there, it’s just a matter of gluing everything together!
Once I’m done with the 8 queens problems, I’ll attack the numerically parametrized problems. Will probably have 2-3 examples (from De Jong functions) as well as the INSANE Griewank function.
The classes used for randomly choosing the next parent chromosomes as well as scaling/ranking can be optimized. But since they just work great since day 1, I’ll keep that for the very end. But I know they can be a lot faster than what they are right now.
I also plan on having a very basic export mechanism so I can dump all those ruzzle chromosomes in a MySQL database to be able to do some reporting and study the various policies and their effects.
I started adding comments to the classes, mostly to keep references, maintain a todo list per class and add some notes for myself to quickly remember why things work that way!
I’ll probably have an image by tomorrow that will run simulations for the ruzzle problem full-time. I wanna beat that record!