How to deal with a constraint in Genetic Algorithm when none of the population members obeys it?
Instead of just random, start with a random solution with constraints. Generate one circle, then find the feasible space for next circle, create second circle and continue until you generate entire generation.
My goal is to apply GA to find optimum locations to place a number of circles (equal dia) in a 2D plane such that no two circles are closer than a certain distance. I account for the proximity constrain by setting the fitness function to -1 if the constraint is broken but the problem is none of the initial population randomly generated follows the proximity constraint thus making the fitness of all the members -1.
By googling, I found that if the plane is separated in to grids with the size of clearance I won't have this problem, but I'm afraid it will miss a lot of potential solution. Is there a method to incorporate the proximity constraint or should I go with the grid?