I changed the fork mutation algorithm so that _move_utilized_commands only has to be called once and _insert_fork behaves similarly to the original algorithm. These changes result in a faster algorithm runtime and less algorithm calls to reach convergence when used in evolutionary algorithm problems.
I changed the fork mutation algorithm so that _move_utilized_commands only has to be called once and _insert_fork behaves similarly to the original algorithm. These changes result in a faster algorithm runtime and less algorithm calls to reach convergence when used in evolutionary algorithm problems.