Exact Solution of the Quadratic Knapsack Problem
INFORMS Journal on Computing
Evolutionary Test Program Induction for Microprocessor Design Verification
ATS '02 Proceedings of the 11th Asian Test Symposium
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem
INFORMS Journal on Computing
A model free method to generate human genetics datasets with complex gene-disease relationships
EvoBIO'10 Proceedings of the 8th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
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.