Exploiting Fitness Distance Correlation of Set Covering Problems

  • Markus Finger
  • Thomas Stützle
  • Helena Lourenço
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2279)

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 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Markus Finger
    • 1
  • Thomas Stützle
    • 1
  • Helena Lourenço
    • 2
  1. 1.Intellectics GroupDarmstadt University of TechnologyDarmstadtGermany
  2. 2.Department of Economics and BusinessUniversitat Pompeu FabraBarcelonaSpain

Personalised recommendations