Core instances for testing: A case study [An article from: European Journal of Operational Research]

This digital document is a journal article from European Journal of Operational Research, published by Elsevier in . The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
Data generation for computational testing of optimization algorithms is a key topic in experimental algorithmics. Recently, concern has arisen that many published computational experiments are inadequate with respect to the way test instances are generated. In this paper we suggest a new research direction that might be useful to cope with the possible limitations of data generation. The basic idea is to select a finite set of instances which 'represent' the whole set of instances. We propose a measure of the representativeness of an instance, which we call @e-representativeness: for a minimization problem, an instance x"@e is @e-representative of another instance x if a (1+@e)-approximate solution to x can be obtained by solving x"@e. Focusing on a strongly NP-hard single machine scheduling problem, we show how to map the infinite set of all instances into a finite set of @e-representative core instances. We propose to use this finite set of @e-representative core instances to test heuristics.