Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Search space boundary extension method in real-coded genetic algorithms
Information Sciences—Informatics and Computer Science: An International Journal - Special issue on evolutionary algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Natural language tagging with genetic algorithms
Information Processing Letters
Optimal antenna placement using a new multi-objective chc algorithm
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Geometric crossovers for multiway graph partitioning
Evolutionary Computation
Feature-based image registration by means of the CHC evolutionary algorithm
Image and Vision Computing
Quotient geometric crossovers and redundant encodings
Theoretical Computer Science
| Hi-index | 0.00 |
The maximum k-coverage problem is a generalized version of covering problems. We introduce the problem formally and analyze its property in relation to the operators of genetic algorithm. Based on the analysis, we propose a new crossover tailored to the maximum k-coverage problem. While traditional n-point crossovers have a problem of requiring repair steps, the proposed crossover has an additional advantage of always producing feasible solutions. We give a comparative analysis of the proposed crossover through experiments.