The set covering problem is an NP-hard combinatorial optimization problem that arises in applications ranging from crew scheduling in airlines to driver scheduling in public mass transport. In this paper we analyze search space characteristics of a widely used set of benchmark instances through an analysis of the fitness-distance correlation. This analysis shows that there exist several classes of set covering instances that show a largely different behavior. For instances with high fitness distance correlation, we propose new ways of generating core problems and analyze the performance of algorithms exploiting these core problems. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Finger, M., Stützle, T., & Lourenco, H. (2002). Exploiting fitness distance correlation of set covering problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2279 LNCS, pp. 61–71). Springer Verlag. https://doi.org/10.1007/3-540-46004-7_7
Mendeley helps you to discover research relevant for your work.