Hi, Thank you Nicolas and Anne for the hints/links @Alex Yes, genetic algorithms are “abstract” algorithms. I am actually talking about analysing the code of the frameworks for developing different genetic algorithms to solve all kinds of optimisation problems (knapsack, Traveling Salesman Problem but also “real life" problems : image processing, and many artificial intelligence problems) There are many GA frameworks. Some popular ones are : ECJ (https://cs.gmu.edu/~eclab/projects/ecj/), OpenBeagle (http://vision.gel.ulaval.ca/~parizeau/Publications/beagle-gecco.pdf), WatchMaker (http://watchmaker.uncommons.org/), HeuristicLab (http://dev.heuristiclab.com/)… Abdelghani Message: 4 Date: Thu, 16 Feb 2017 11:02:44 -0300 From: Alexandre Bergel <alexandre.bergel(a)me.com> To: Moose-related development <moose-dev(a)list.inf.unibe.ch> Subject: [Moose-dev] Re: software reingineering guidelines Message-ID: <9D54173C-8CD7-4873-A5F9-AC0EF570EAB2(a)me.com> Content-Type: text/plain; charset=utf-8 Ah ah! Sorry, I read too fast! But it is not clear what are you referring to when you mention “generic algorithm”? Can you give an example? Alexandre