Exploiting Fitness Distance Correlation of Set Covering Problems

Authors:
Markus Finger;Thomas Stützle;Helena Lourenço
Affiliations:
-;-;-
Venue:
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Year:
2002

Citing 5
Cited 1

A Lagrangian-based heuristic for large-scale set covering problems

Mathematical Programming: Series A and B - Special issue on computational integer programming
An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew Scheduling

Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms

Proceedings of the 6th International Conference on Genetic Algorithms
A Heuristic Method for the Set Covering Problem

Operations Research
Multiobjective Metaheuristics for the Bus Driver Scheduling Problem

Transportation Science

New ideas for applying ant colony optimization to the set covering problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

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.