2020•Unpublished venueRequires access

A Novel Evolutionary Algorithm with Pareto Front Adaption for Many-objective Optimization

Li Li, Avimanyu Sahoo, Liang Chang

Open publisher page 6 citations

Abstract

Evolutionary algorithms have been used to solve a variety of multi-objective optimization problems. However, those algorithms are very sensitive to the curvature of Pareto front, whereas the shape of the front usually hard to obtain beforehand. This paper proposes a new Pareto front estimation based evolutionary algorithm referred to as PaE/EA for many-objective optimization. In this algorithm, the geometric information of Pareto front is estimated by using achievement scalarizing function, which can help to solve the problems more efficiently. The proposed algorithm is compared with four representative algorithms on DTLZ and WFG test suites. It also has been testified by the multi-objective version of traveling salesman problem. The experiment results indicate that the proposed approach has a competitive performance.

About this research paper

What this paper is about

Evolutionary algorithms have been used to solve a variety of multi-objective optimization problems. However, those algorithms are very sensitive to the curvature of Pareto front, whereas the shape of the front usually hard to obtain beforehand. This paper proposes a new Pareto front estimation based evolutionary algorithm referred to as PaE/EA for many-objective optimization. In this algorithm, the geometric information of Pareto front is estimated by using achievement scalarizing function, which can help to solve the problems more efficiently. The proposed algorithm is compared with four representative algorithms on DTLZ and WFG test suites. It also has been testified by the multi-objective version of traveling salesman problem. The experiment results indicate that the proposed approach has a competitive performance.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Evolutionary algorithms have been used to solve a variety of multi-objective optimization problems. However, those algorithms are very sensitive to the curvature of Pareto front, whereas the shape of the front usually hard to obtain beforehand. This paper proposes a new Pareto front estimation based evolutionary algorithm referred to as PaE/EA for many-objective optimization. In this algorithm, the geometric information of Pareto front is estimated by using achievement scalarizing function, which can help to solve the problems more efficiently. The proposed algorithm is compared with four representative algorithms on DTLZ and WFG test suites. It also has been testified by the multi-objective version of traveling salesman problem. The experiment results indicate that the proposed approach has a competitive performance.

Key concepts: Multi-objective optimization, Evolutionary algorithm, Pareto principle, Mathematical optimization, Computer science, Curvature, Algorithm, Evolutionary computation

Related papers

Back to paper searchBrowse research topicsOriginal source
A Novel Evolutionary Algorithm with Pareto Front Adaption for Many-objective Optimization — Research Paper | ScholarLens