Mostra el registre parcial de l'element
dc.contributor.author | Finger, Markus |
dc.contributor.author | Stützle, Thomas |
dc.contributor.author | Ramalhinho-Lourenço, Helena |
dc.contributor.other | Universitat Pompeu Fabra. Departament d'Economia i Empresa |
dc.date.accessioned | 2017-07-26T10:49:52Z |
dc.date.available | 2017-07-26T10:49:52Z |
dc.date.issued | 2001-11-01 |
dc.identifier | https://econ-papers.upf.edu/ca/paper.php?id=582 |
dc.identifier.citation | Applications of Evolutionary Computing, S. Cagnoni, J. Gottlieb, E. Hart, M. Middenford, and G. R. Raidl (eds.), Springer-LNCS, vol. 2279, pp. 61-71 (2002) |
dc.identifier.uri | http://hdl.handle.net/10230/1147 |
dc.description.abstract | 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 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. |
dc.format.mimetype | application/pdf |
dc.language.iso | eng |
dc.relation.ispartofseries | Economics and Business Working Papers Series; 582 |
dc.rights | L'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 Commons |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.title | Exploiting fitness distance correlation of set covering problems |
dc.type | info:eu-repo/semantics/workingPaper |
dc.date.modified | 2017-07-23T02:06:29Z |
dc.subject.keyword | set covering |
dc.subject.keyword | iterated local search |
dc.subject.keyword | Operations Management |
dc.rights.accessRights | info:eu-repo/semantics/openAccess |