Abstract
In This Paper, a Non-Standard Hybrid Genetic Algorithm is Presented. the Approach is Non-Standard in that It Violates Some of the Common Attributes Associated with Genetic Algorithms in the Literature. the Algorithm Presented Uses Local Maxima to Locate the Global Maximum Value, Uses Haploid Chromosomes with Dominance Mating Instead of Crossover, Generates One Offspring Per Set of Parents, Has No Specific Mutation Operator, and is Designed for Rapid Convergence. When Applied to an NP-Complete Problem, the Results of This Hybrid Algorithm Are Shown to Be Very Successful in Reducing the Complexity of the Problem.
Recommended Citation
R. Rankin et al., "A Hybrid Genetic Algorithm for an NP-Complete Problem with an Expensive Evaluation Function," Proceedings of the ACM Symposium on Applied Computing, pp. 251 - 256, Association for Computing Machinery, Mar 1993.
The definitive version is available at https://doi.org/10.1145/162754.162889
Department(s)
Computer Science
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2023 Association for Computing Machinery, All rights reserved.
Publication Date
01 Mar 1993
