TY - JOUR
T1 - Evolving combinatorial problem instances that are difficult to solve
JF - Evolutionary Computation
Y1 - 2006
A1 - van Hemert, J. I.
KW - constraint programming
KW - constraint satisfaction
KW - evolutionary computation
KW - problem evolving
KW - satisfiability
KW - travelling salesman
AB - In this paper we demonstrate how evolutionary computation can be used to acquire difficult to solve combinatorial problem instances, thereby stress-testing the corresponding algorithms used to solve these instances. The technique is applied in three important domains of combinatorial optimisation, binary constraint satisfaction, Boolean satisfiability, and the travelling salesman problem. Problem instances acquired through this technique are more difficult than ones found in popular benchmarks. We analyse these evolved instances with the aim to explain their difficulty in terms of structural properties, thereby exposing the weaknesses of corresponding algorithms.
VL - 14
UR - http://www.mitpressjournals.org/toc/evco/14/4
ER -