Open
Description
a whole class of problems such as topological partitioning or bezier path finding naturally lend themselves to variable-length genetic alogorithms. the first GA I ever wrote was variable length. I was surprised to find that this is not an option.
This could be added simply by allowing per-parent selection of points in mutation.