Taxonomy of a Diverse Collection of String Optimization Problems


This study builds on previous work that classifies evolutionary computation problems via graph-based taxonomic techniques. A new collection of graphs that permit the measurement of small population effects are employed as well as a new distance measure that incorporates information on the variability of problem hardness into the taxonomic process. The new set of graphs and improved distance measure on problems are tested on a diverse set of string-based optimization problems including two new types of problems: fragmentation and K-max. The familiar SAW, one-max, and royal road problems are also included. It is found that problem difficulty, although explicitly removed from the information used to classify the problems, is nevertheless detected by the taxonomic technique. The problems appearing in earlier studies are shown to retain their diversity of behavior, confirming that the improvements to the problem classification system did not degrade a valuable feature of the earlier system.

  • Abstract
  • 1 Introduction
  • 2 Modification to Graph Based Problem Taxonomy
  • 3 The String Problems
  • 4 Experimental Design
  • 5 Results and Discussion
  • 6 Conclusions
  • Acknowledgments
  • References

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In