Finger, MarkusStützle, ThomasRamalhinho-Lourenço, HelenaUniversitat Pompeu Fabra. Departament d'Economia i Empresa2017-07-262017-07-262001-11-01Applications of Evolutionary Computing, S. Cagnoni, J. Gottlieb, E. Hart, M. Middenford, and G. R. Raidl (eds.), Springer-LNCS, vol. 2279, pp. 61-71 (2002)http://hdl.handle.net/10230/1147The 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 have 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.application/pdfengL'accés als continguts d'aquest document queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commonsinfo:eu-repo/semantics/workingPaperset coveringiterated local searchOperations Managementinfo:eu-repo/semantics/openAccess