A Rough Set Penalty Function for Marriage Selection in Multiple-Evaluation Genetic Algorithms

Penalty functions are often used to handle constrained optimization problems in evolutionary algorithms. However, most of the penalty adjustment methods are based on mathematical approaches not on evolutionary ones. To mimic the biological phenomenon of the values judgment, we introduce the rough set theory as a novel penalty adjustment method. Furthermore, a new marriage selection is proposed in this paper to modify the multiple-evaluation genetic algorithm. By applying rough-penalty and marriage-selection methods, the proposed algorithm generally is both effective and efficient in solving several constrained optimization problems. The experimental results also show that the proposed mechanisms further improve and stabilize the solution ability.