Alain Lanthier

Hi langongjin, I will implement the required crossovers. AL

Yes, it is recommended to be nearer 1.0. (http://www.nashcoding.com/2010/07/07/evolutionary-algorithms-the-little-things-youd-never-guess-part-1/) But I dont see much improvement by doing so in my tests cases! I will add more tests cases (and optimize...

Yes, mutation rate should change based on efficiency of the search... (Need to measure it first - TODO!) (https://www.dynardo.de/fileadmin/Material_Dynardo/bibliothek/WOST_2.0/WOST_2_AdaptiveMutation_En.pdf) Let me know the algos for GAM you want to try....

Hi langongjin, Thanks Yes, I`m currently fixing the various issues - work in progress in my branch. -sigma are not correctly transmit between parent/child (This is a new feature I...

Hi, Xover for real-valued representation are in my branch now: RealValuedSimpleArithmeticRecombination RealValuedSingleArithmeticRecombination RealValuedWholeArithmeticRecombination Setup - see example.cpp: T recombination_ratio = 0.55; // Real Valued crossover void(*CrossOver)(const Population&, CHR&, CHR&) =...

Just pushed some fixes

Sorry, it is now fixed.

Side note: You can have unlimited AES size by moving stuff into the heap using vector without changing the code much. I have tested AES 8196 (and exporting/importing tables into/from...