Exploiting Fitness Distance Correlation of Set Covering Problems
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.
KeywordsLocal Search Core Problem Iterate Local Search Crew Schedule Driver Schedule
Unable to display preview. Download preview PDF.
- 1.E. Housos and T. Elmoth. Automatic optimization of subproblems in scheduling airlines crews. Interfaces, 27(5):68–77, 1997.Google Scholar
- 4.A. Caprara, M. Fischetti, and P. Toth. Algorithms for the set covering problem. Technical Report OR-98-3, DEIS, University of Bologna, Italy, 1998.Google Scholar
- 8.A.V. Eremeev. A genetic algorithm with a non-binary representation for the set covering problem. In Proceedings of OR’98, pages 175–181. Springer Verlag, 1999.Google Scholar
- 10.H.R. Lourenço, O. Martin, and T. Stützle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics. Kluwer Academic Publishers, Boston, MA, USA, 2002. to appear.Google Scholar
- 11.E. Marchiori and A. Steenbeek. An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. In Real World Applications of Evolutionary Computing, volume 1083 of Lecture Notes in Computer Science, pages 367–381. Springer Verlag, Berlin, Germany, 2000.Google Scholar
- 12.M. Kishida M. Yagiura and T. Ibaraki. A 3-flip neighborhood local search for the set covering problem. submitted for publication, 2001.Google Scholar
- 13.T. Jones and S. Forrest. Fitness distance correlation as a measure of problem dificulty for genetic algorithms. In L.J. Eshelman, editor, Proc. of the 6th Int. Conf. on Genetic Algorithms, pages 184–192. Morgan Kaufman, 1995.Google Scholar
- 14.P.F. Stadler. Towards a theory of landscapes. Technical Report Technical Report SFI-95-03-030, Santa Fe Institute, 1995.Google Scholar