Abstract
On certain classes of problems, recombination is more effective if the parents that are being recombined share common subsolutions. These common subsolutions can be used to decompose the recombination space into linearly independent subproblems. If a problem can be decomposed into k subproblems, a single greedy recombination can select the best of 2k possible offspring. The idea of exploiting decomposability works well for the Traveling Salesman Problem, and appears to be applicable to other problems such as Graph Coloring. For Search Based Software Engineering, these ideas might be useful, for example, when applying Genetic Programming to fix software bugs in large programs. Another way in which we might achieve decomposability is by exploiting program modularity and reoccurring program patterns.
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
Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press (1975)
Hansen, N., Kern, S.: Evaluating the CMA evolution strategy on multimodal test functions. In: Proceedings of 8th International Conference on Parallel Problem Solving from Nature, Berlin, Germany, pp. 282–291 (2004)
Hansen, N., Ostermeier, A.: Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proc. of the 1996 IEEE Int. Conf. on Evolutionary Computation, pp. 312–317. IEEE Service Center, Piscataway (1996)
Whitley, D., Sutton, A.: Partial elementary landscapes. In: Proceedings of the Genetic and Evolutionary Computation Conference. ACM Press, New York (2009)
Grover, L.K.: Local search and the local structure of NP-complete problems. Op- erations Research Letters 12, 235–243 (1992)
Stadler, P.F.: Spectral landscape theory. In: Crutchfield, J., Schuster, P. (eds.) Evolutionary Dynamics - Exploring the Interplay of Selection, Neutrality, Accident, and Function. Oxford University Press, Oxford (2002)
Whitley, D., Hains, D., Howe, A.: A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 566–575. Springer, Heidelberg (2010)
Croes, G.: A method for solving traveling-salesman problems. Operations Research, 791–812 (1958)
Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 498–516 (1973)
Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing 15(1), 82–92 (2003)
Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: A case study in local optimization. In: Aarts, E.H.L., Lenstra, J. (eds.) Local Search in Combinatorial Optimization, pp. 215–310. John Wiley and Sons Ltd, Chichester (1997)
Lipton, R., Tarjan, R.: A separator theorem for planar graphs. SIAM Journal of Applied Math. 36, 177–189 (1979)
Leighton, T., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 422–431. IEEE Press, Los Alamitos (1988)
Weimer, W., Nguyen, T., Goues, C.L., Forrest, S.: Automatically finding patches using genetic programming. In: International Conference on Software Engineering (ICSE), pp. 364–374 (2009)
Forrest, S., Weimer, W., Nguyen, T., Goues, C.L.: A genetic programming approach to automated software repair. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 947–954. ACM Press, New York (2009)
Weimer, W., Nguyen, T., Goues, C.L., Forrest, S.: Automatic program repair with evolutionary computation. Communications of the ACM 53(5), 109–116 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Whitley, D. (2011). Exploiting Decomposability Using Recombination in Genetic Algorithms: An Exploratory Discussion. In: Cohen, M.B., Ó Cinnéide, M. (eds) Search Based Software Engineering. SSBSE 2011. Lecture Notes in Computer Science, vol 6956. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23716-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-23716-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23715-7
Online ISBN: 978-3-642-23716-4
eBook Packages: Computer ScienceComputer Science (R0)