作者: K. Liagkouras , K. Metaxiotis
DOI:
关键词:
摘要: This paper re-examines the classical polynomial mutation (PLM) operator and proposes a probe guided version of PLM for more efficient exploration search space. The proposed (PGM) applied to two well-known MOEAs, namely non-dominated sorting genetic algorithm II (NSGAII) strength Pareto evolutionary 2 (SPEA2), under different sets test functions. relevant results are compared with derived by same MOEAs using their typical configuration operator. experimental show that outperforms operator, based on number performance metrics evaluate both proximity solutions front dispersion it.