Structure-Preserving Instance Generation

• Published in: Learning and Intelligent Optimization Vol. 10079; pp. 123 - 140
• Main Authors: Malitsky, Yuri, Merschformann, Marius, O’Sullivan, Barry, Tierney, Kevin
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2016; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Algorithm Configuration; Industrial Instances; Maximum SAT (MaxSAT); Portfolio Techniques; Representative Genes
• ISBN: 3319503480; 9783319503486
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-50349-3_9

Real-world instances are critical for the development of state-of-the-art algorithms, algorithm configuration techniques, and selection approaches. However, very few true industrial instances exist for most problems, which poses a problem both to algorithm designers and methods for algorithm selection. The lack of enough real data leads to an inability for algorithm designers to show the effectiveness of their techniques, and for algorithm selection it is difficult or even impossible to train a portfolio with so few training examples. This paper introduces a novel instance generator that creates instances that have the same structural properties as industrial instances. We generate instances through a large neighborhood search-like method that combines components of instances together to form new ones. We test our approach on the MaxSAT and SAT problems, and then demonstrate that portfolios trained on these generated instances perform just as well or even better than those trained on the real instances.