This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Exploiting Fitness Distance Correlation of Set Covering Problems

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Markus Finger
Thomas Stützle
Helena Ramalhinho-Lourenço ()
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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.econ.upf.edu/docs/papers/downloads/582.pdf
File Format: application/pdf
File Function: Whole Paper
Download Restriction: no

Publisher Info
Paper provided by Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number 582.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: Nov 2001
Date of revision:
Handle: RePEc:upf:upfgen:582

Contact details of provider:
Web page: http://www.econ.upf.edu/

For technical questions regarding this item, or to correct its listing, contact: ().

Related research
Keywords: Set covering; iterated local search;

Find related papers by JEL classification:
C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis
C63 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Computational Techniques
D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search, Learning, and Information

This paper has been announced in the following NEP Reports:

Statistics
Access and download statistics

Did you know? IDEAS indexes over 800000 items of research in Economics alone.

This page was last updated on 2009-12-18.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.