2017•Unpublished venueOpen access

A proportion-based selection scheme for multi-objective optimization

Liuwei Fu, Juan Zou, Shengxiang Yang, Gan Ruan, Zhongwei Ma, Jinhua Zheng

Open full text 3 citations

Abstract

Classical multi-objective evolutionary algorithms (MOEAs) have been proven to be inefficient for solving multi-objective optimizations problems when the number of objectives increases due to the lack of sufficient selection pressure towards the Pareto front (PF). This poses a great challenge to the design of MOEAs. To cope with this problem, researchers have developed reference-point based methods, where some well-distributed points are produced to assist in maintaining good diversity in the optimization process. However, the convergence speed of the population may be severely affected during the searching procedure. This paper proposes a proportion-based selection scheme (denoted as PSS) to strengthen the convergence to the PF as well as maintain a good diversity of the population. Computational experiments have demonstrated that PSS is significantly better than three peer MOEAs on most test problems in terms of diversity and convergence.

Open-access reader

About this research paper

What this paper is about

Classical multi-objective evolutionary algorithms (MOEAs) have been proven to be inefficient for solving multi-objective optimizations problems when the number of objectives increases due to the lack of sufficient selection pressure towards the Pareto front (PF). This poses a great challenge to the design of MOEAs. To cope with this problem, researchers have developed reference-point based methods, where some well-distributed points are produced to assist in maintaining good diversity in the optimization process. However, the convergence speed of the population may be severely affected during the searching procedure. This paper proposes a proportion-based selection scheme (denoted as PSS) to strengthen the convergence to the PF as well as maintain a good diversity of the population. Computational experiments have demonstrated that PSS is significantly better than three peer MOEAs on most test problems in terms of diversity and convergence.

Why it matters

OpenAlex reports 3 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

Classical multi-objective evolutionary algorithms (MOEAs) have been proven to be inefficient for solving multi-objective optimizations problems when the number of objectives increases due to the lack of sufficient selection pressure towards the Pareto front (PF). This poses a great challenge to the design of MOEAs. To cope with this problem, researchers have developed reference-point based methods, where some well-distributed points are produced to assist in maintaining good diversity in the optimization process. However, the convergence speed of the population may be severely affected during the searching procedure. This paper proposes a proportion-based selection scheme (denoted as PSS) to strengthen the convergence to the PF as well as maintain a good diversity of the population. Computational experiments have demonstrated that PSS is significantly better than three peer MOEAs on most test problems in terms of diversity and convergence.

Key concepts: Convergence (economics), Mathematical optimization, Selection (genetic algorithm), Multi-objective optimization, Computer science, Scheme (mathematics), Population, Evolutionary algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
A proportion-based selection scheme for multi-objective optimization — Research Paper | ScholarLens