Skip to main navigation Skip to search Skip to main content

Monogamous pair bonding in genetic algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

A new variant of the Genetic Algorithm (GA) inspired by monogamy mating system is put forward. The Monogamous Pairs Genetic Algorithm (MopGA) incorporates two important operations: pair bonding and infidelity at a small probability. With pair bonding, parents continue to mate at each iteration until their bond expires. In the meantime, infidelity generates variety and promotes diversity via mating with extrapair. We evaluate the algorithm's performance using various parametrizations and making comparisons to the Standard Genetic Algorithm (SGA) based on the Hierarchical If-and-Only-If (HIFF) and Deceptive (DP) functions. Empirical results show that incorporating pair bonding is a practical move. Improvement in performance in terms of solution quality and computational efforts have been observed for all test problems. Additionally, we also report the effectiveness of MopGA in handling easy and difficult sudoku puzzles.

Original languageEnglish
Title of host publication2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages15-22
Number of pages8
ISBN (Electronic)9781479974924
DOIs
StatePublished - 10 Sep 2015
EventIEEE Congress on Evolutionary Computation, CEC 2015 - Sendai, Japan
Duration: 25 May 201528 May 2015

Publication series

Name2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings

Conference

ConferenceIEEE Congress on Evolutionary Computation, CEC 2015
Country/TerritoryJapan
CitySendai
Period25/05/1528/05/15

Fingerprint

Dive into the research topics of 'Monogamous pair bonding in genetic algorithm'. Together they form a unique fingerprint.

Cite this