Exploiting decomposability using recombination in genetic algorithms: an exploratory discussion

Authors:
Darrell Whitley
Affiliations:
Colorado State University, Fort Collins, CO
Venue:
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
Year:
2011

Citing 7
Cited 0

Chained Lin-Kernighan for Large Traveling Salesman Problems

INFORMS Journal on Computing
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Automatically finding patches using genetic programming

ICSE '09 Proceedings of the 31st International Conference on Software Engineering
Partial neighborhoods of elementary landscapes

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A genetic programming approach to automated software repair

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Automatic program repair with evolutionary computation

Communications of the ACM
A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I

Quantified Score

Hi-index	0.00

Visualization

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.