IAMGA: Intimate-Based Assortative Mating Genetic Algorithm

摘要

Standard Genetic Algorithms (SGAs) is modeled as a simple set of fixed size individuals and each individual has no gender. The idea is based on non-random mating and important role of religious in the organization of societies. Essential concepts of religions are commandments and religious customs, which influence the behavior of the individuals. This paper proposes the Intimate-Based Assortative Mating Genetic Algorithm (IAMGA) and explores the affect of including ntimate-based assortative mating to improve the performance of genetic algorithms. The IAMGA combined gender-based, variable-size and ntimate-based assortative mating feature. All mentioned benchmark instances were clearly better than the performance of a SGA.