An empirical study of hybrid genetic algorithms for the set covering problem

The purpose of this paper is to explore the computational performance of several hybrid algorithms that are extensions of a basic genetic algorithm (GA) approach for solving the set covering problem (SCP). We start by making several enhancements to a GA for the SCP that was proposed by Beasley and Chu. Next, several hybrid solution approaches are introduced that combine the GA with various local neighbourhood search approaches, with a form of the greedy randomized adaptive search procedure, and with an estimation of distribution algorithms approach. Using Beasley's library of SCPs extensive computational results are generated for the hybrid solution approaches defined in this paper. Statistical analyses of the results are performed.

[1]  Jan Karel Lenstra,et al.  A local search template , 1998, Comput. Oper. Res..

[2]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[3]  J. E. Freund,et al.  Modern Elementary Statistics , 1968 .

[4]  Colin R. Reeves,et al.  Genetic Algorithms for the Operations Researcher , 1997, INFORMS J. Comput..

[5]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[6]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[7]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[8]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[9]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[10]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[11]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[12]  Fischetti Caprara,et al.  An Indirect Genetic Algorithm for Set Covering Problems , 2002 .

[13]  K. Al-Sultan,et al.  A Genetic Algorithm for the Set Covering Problem , 1996 .

[14]  Lashon B. Booker,et al.  Proceedings of the fourth international conference on Genetic algorithms , 1991 .

[15]  Francis J. Vasko,et al.  An efficient heuristic for large set covering problems , 1984 .

[16]  Neil Salkind,et al.  Using SPSS for Windows: Analyzing and Understanding Data with Disk , 1997 .

[17]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .