Taming the 0/1 knapsack problem with monogamous pairs genetic algorithm
作者：
Highlights：
• Introduced pair bonding, inspired by social monogamy into genetic algorithm.
• Monogamous parent chromosomes are re-mated every generation until pair bond expires.
• Occasional infidelity generates variety and promotes diversity in the population.
• Applied the algorithm in solving 25 benchmark 0/1 knapsack problems.
• Convergence behavior, diversity analysis and computational effort are presented.
摘要
•Introduced pair bonding, inspired by social monogamy into genetic algorithm.•Monogamous parent chromosomes are re-mated every generation until pair bond expires.•Occasional infidelity generates variety and promotes diversity in the population.•Applied the algorithm in solving 25 benchmark 0/1 knapsack problems.•Convergence behavior, diversity analysis and computational effort are presented.
论文关键词：0/1 knapsack problem,Genetic algorithm,Monogamous pair,Pair bonding,Infidelity
论文评审过程：Received 24 November 2014, Revised 26 January 2016, Accepted 27 January 2016, Available online 8 February 2016, Version of Record 22 February 2016.
论文官网地址：https://doi.org/10.1016/j.eswa.2016.01.055
