IAMGA: Intimate-Based Assortative Mating Genetic Algorithm

  • Fatemeh Ramezani
  • Shahriar Lotfi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7076)


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 intimate-based assortative mating to improve the performance of genetic algorithms. The IAMGA combined gender-based, variable-size and intimate-based assortative mating feature. All mentioned benchmark instances were clearly better than the performance of a SGA.


Standard Genetic Algorithm Gender-Based Genetic Algorithm Gender Assortative Mating Intimate Relationship and Infusion Operator 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Goldberg, D.E.: Genetic algorithms in Search, Optimization and Machine Learning. Addison-Wesley (1989)Google Scholar
  2. 2.
    Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
  3. 3.
    de Castro, J.P., Posta, A., Bittencourt, G.: A Genetic Algorithm with Feminine Selection. In: Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI 2004, pp. 244–248 (2004)Google Scholar
  4. 4.
    Sanchez-Velazco, J., Bullinaria, J.A.: Sexual Selection with Competitive/Co-Operative Operators for Genetic Algorithms. In: IASTED International Conference on Neural Networks and Computational Intelligence, NCI (2003)Google Scholar
  5. 5.
    Ansótegui, C., Sellmann, M., Tierney, K.: A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142–157. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Savic, A., Tosic, D., Maric, M., Kratica, J.: Genetic Algorithm Approach for Solving the Task Assignment Problem. Serdica Journal of Computing 2(3), 267–276 (2008)zbMATHGoogle Scholar
  7. 7.
    Mahfouz, S.Y., Toropov, V.V., Westbrook, R.K.: Modification, tuning and testing of a GA for structural optimization problems. In: 1st AMSO UK/ISSMO Conference on Engineering Design Optimization, pp. 271–278 (1999)Google Scholar
  8. 8.
    Vrajitoru, D.: Simulating gender separation with genetic algorithms. In: Proceedings of the Genetic and Evolutionary Compuatation Conference (GECCO 2002), pp. 634–641 (2002)Google Scholar
  9. 9.
    Lis, J., Eiben, A.E.: A Multi-Sexual Genetic Algorithm for Multiobjective Optimization. In: Proceedings of the 1996 International Conference on Evolutionary Computation, Nagoya, Japan, pp. 59–64. IEEE (1996)Google Scholar
  10. 10.
    Rejeb, J., AbuElhaija, M.: New gender genetic algorithm for solving graph partitioning problems. In: Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems, vol. 1, pp. 444–446 (2000)Google Scholar
  11. 11.
    Allenson, R.: Genetic algorithms with gender for multi-function optimization. Technical Report EPCC-SS92-01, Edinburgh Parallel Computing Centre (1992)Google Scholar
  12. 12.
    Ratford, M., Tuson, A., Thompson, H.: Applying Sexual Selection as a Mechanism for Obtaining Multiple Distinct Solutions. Presented at Emerging Technologies 1997 (1997a)Google Scholar
  13. 13.
    Ratford, M., Tuson, A., Thompson, H.: The Single Chromosome’s Guide to Dating. In: Third International Conference on Artificial Neural Networks and Genetic Algorithms (1997b)Google Scholar
  14. 14.
    Ronald, E.: When Selection meets Seduction. In: The Sixth International Conference on Genetic Algorithms, pp. 167–173 (1995)Google Scholar
  15. 15.
    Song Goh, K., Lim, A., Rodrigues, B.: Sexual Selection for Genetic Algorithms. Artificial Intelligence Review 19(2), 123–152 (2003)CrossRefGoogle Scholar
  16. 16.
    Garcia-Martinez, C., Lozano, M.: Hybrid Real-Coded Genetic Algorithms with Female and Male Differentiation. In: Congress on Evolutionary Computation, pp. 896–903 (2005)Google Scholar
  17. 17.
    Wagner, S., Affenzeller, M.: SexualGA: Gender-Specific Selection for Genetic Algorithms. In: The 9th World Multi-Conference on Systemics, Cybernetics and Informatics, pp. 76–81 (2005)Google Scholar
  18. 18.
    Tang, K.: Benchmark Functions for the CEC 2010 Special Session and Competition on Large-Scale Global Optimization: Nature Inspired Computation and Applications Laboratory (2010), Technical report
  19. 19.
    De Jong, K.A.: Analysis of the Behavior of a Class of Genetic Adaptive Systems, Ph.D. thesis, University of Michigan, Ann Arbor (1975)Google Scholar
  20. 20.
    Randy, L., Haupt, S.: Practical Genetic Algorithms. Wiley-IEEE Publication (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Fatemeh Ramezani
    • 1
  • Shahriar Lotfi
    • 2
  1. 1.Computer Enginering DepartmentCollege of Nabi AkramIran
  2. 2.Computer Science DepartmentUniversity of TabrizIran

Personalised recommendations