The task is to pack big box with several small boxes. The objective is to maximize total area of all small boxes. I made fitness in follow way: it is area minus penalty in case of overlapping small boxes also overlapping area subtracted from fitness. There are several mutations: places exchange, small jump, big jump, random visible/invisible random rotation at 90 degrees, jumps to nearest box
How it works:
Mr. Vedenyov could you please add an explanation to the algorithm.Making something fancy is good, but not worthy if you cant explain it to others.
Or if anyone else is interested in doing so, Most welcome!!
a sequence of code without proper documentation.
that makes it difficult to understand.