Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
Jason Amunrud, Bryant A. Julstrom · 2006
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This technique is called case injection. How similar must the instances be for case injection to help an EA's search? We consider this question by applying a genetic algorithm, without and with case injection, to sequences of instances of binary quadratic programming. When the instances are similar, case injection helps; when the instances differ sufficiently, case injection is no help at all.