Reference-lines-steered memetic multi-objective evolutionary algorithm with adaptive termination criterion

Riddhiman Saikia

doi:10.1007/s12293-021-00324-x

Return

Reference-lines-steered memetic multi-objective evolutionary algorithm with adaptive termination criterion

2021-02-14

PRE

Riddhiman Saikia

Deepak Sharma *

DOI：10.1007/s12293-021-00324-x

Original

Original request for help

Save

Abstract

En 中文

Multi-objective evolutionary algorithms (MOEAs) have been the choice for generating a set of Pareto-optimal (PO) solutions in one run. However, these algorithms sometimes suffer slow and poor convergence toward the PO front. One of the remedies to improve their convergence is to couple global search of MOEAs with local search. However, such coupling brings other implementation challenges, such as what, when, and how many solutions can be chosen for local search with MOEAs? In this paper, these challenges are addressed by developing a local search module that can choose solutions for local search using a set of reference lines. The heuristic strategies are also developed with the module for determining the frequency of executing local search and for terminating MOEA adaptively using a statistical performance indicator. The proposed algorithm, which is referred to as RM(2)OEA, is tested on 2-objective ZDT and 3-objective DTLZ test problems. Results demonstrate faster and improved convergence of RM2 OEA over a benchmark MOEA from the literature.

Keywords:

Multi-objective optimization

Hybrid evolutionary algorithm

Memetic evolutionary algorithm

Reference lines

Adaptive termination condition

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.