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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E. Housos and T. Elmoth. Automatic optimization of subproblems in scheduling airlines crews. Interfaces, 27(5):68–77, 1997.
H. Lourenço, R. Portugal, and J.P. Paix ao. Multiobjective metaheuristics for the bus-driver scheduling problem. Transportation Science, 35(3):331–343, 2001.
F.J. Vasko and F.E. Wolf. Optimal selection of ingot sizes via set covering. Operations Research, 15:115–121, 1988.
A. Caprara, M. Fischetti, and P. Toth. Algorithms for the set covering problem. Technical Report OR-98-3, DEIS, University of Bologna, Italy, 1998.
S. Ceria, P. Nobili, and A. Sassano. A lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming, 81:215–228, 1998.
A. Caprara, M. Fischetti, and P. Toth. A heuristic method for the set covering problem. Operations Research, 47:730–743, 1999.
J.E. Beasley and P.C. Chu. A genetic algorithm for the set covering problem. European Journal of Operational Research, 94:392–404, 1996.
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.
M.J. Brusco, L.W. Jacobs, and G.M. Thompson. A morphing procedure to supplement a simulated annealing heuristic for cost-and coverage-corrleated set covering problems. Annals of Operations Research, 86:611–627, 1999.
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.
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.
M. Kishida M. Yagiura and T. Ibaraki. A 3-flip neighborhood local search for the set covering problem. submitted for publication, 2001.
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.
P.F. Stadler. Towards a theory of landscapes. Technical Report Technical Report SFI-95-03-030, Santa Fe Institute, 1995.
E.D. Weinberger. Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics, 63:325–336, 1990.
K.D. Boese, A.B. Kahng, and S. Muddu. A New Adaptive Multi-Start Technique for Combinatorial Global Optimization. Operations Research Letters, 16:101–113, 1994.
E. Balas and M.C. Carrera. A dynamic subgradient-based branch and bound procedure for set covering. Operations Research, 44:875–890, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finger, M., Stützle, T., Lourenço, H. (2002). Exploiting Fitness Distance Correlation of Set Covering Problems. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds) Applications of Evolutionary Computing. EvoWorkshops 2002. Lecture Notes in Computer Science, vol 2279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46004-7_7
Download citation
DOI: https://doi.org/10.1007/3-540-46004-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43432-0
Online ISBN: 978-3-540-46004-6
eBook Packages: Springer Book Archive