Evolving heuristically difficult instances of combinatorial problems

When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, and it may not be obvious what kinds of instances challenge or confound the heuristic. An evolutionary algorithm can search a space of problem instances for cases that are heuristically difficult. Evaluation in such an EA requires an exact algorithm for the problem, which limits the sizes of the instances that can be explored, but the EA's (small) results can reveal misleading patterns or structures that can be replicated in larger instances. As an example, a genetic algorithm searches for instances of the quadratic knapsack problem that are difficult for a straightforward greedy heuristic. The GA identifies such instances, which in turn reveal patterns that mislead the heuristic. c ACM, 2009. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not f...

• Type: Conference
• Year: 2009
• Where: GECCO
• Authors: Bryant A. Julstrom
• Keywords: GECCO 2009, Keywords Problem Instances, Optimization, Problem Instances, Quadratic Knapsack Problem