scispace - formally typeset
Journal ArticleDOI

An Evolutionary Algorithm Based on Minkowski Distance for Many-Objective Optimization

Reads0
Chats0
TLDR
Empirical results show that the proposed algorithm is very competitive against other MaOEAs for solving MaOPs, and two modified compared algorithms are generally more effective than their predecessors.
Abstract
The existing multiobjective evolutionary algorithms (EAs) based on nondominated sorting may encounter serious difficulties in tackling many-objective optimization problems (MaOPs), because the number of nondominated solutions increases exponentially with the number of objectives, leading to a severe loss of selection pressure. To address this problem, some existing many-objective EAs (MaOEAs) adopt Euclidean or Manhattan distance to estimate the convergence of each solution during the environmental selection process. Nevertheless, either Euclidean or Manhattan distance is a special case of Minkowski distance with the order ${P=2}$ or ${P=1}$ , respectively. Thus, it is natural to adopt Minkowski distance for convergence estimation, in order to cover various types of Pareto fronts (PFs) with different concavity–convexity degrees. In this paper, a Minkowski distance-based EA is proposed to solve MaOPs. In the proposed algorithm, first, the concavity–convexity degree of the approximate PF, denoted by the value of ${P}$ , is dynamically estimated. Subsequently, the Minkowski distance of order ${P}$ is used to estimate the convergence of each solution. Finally, the optimal solutions are selected by a comprehensive method, based on both convergence and diversity. In the experiments, the proposed algorithm is compared with five state-of-the-art MaOEAs on some widely used benchmark problems. Moreover, the modified versions for two compared algorithms, integrated with the proposed ${P}$ -estimation method and the Minkowski distance, are also designed and analyzed. Empirical results show that the proposed algorithm is very competitive against other MaOEAs for solving MaOPs, and two modified compared algorithms are generally more effective than their predecessors.

read more

Citations
More filters
Journal ArticleDOI

Solving Large-Scale Multiobjective Optimization Problems With Sparse Optimal Solutions via Unsupervised Neural Networks

TL;DR: An evolutionary algorithm to solve sparse LMOPs by learning the Pareto-optimal subspace using two unsupervised neural networks, a restricted Boltzmann machine, and a denoising autoencoder to learn a sparse distribution and a compact representation of the decision variables.
Journal ArticleDOI

Hyperplane Assisted Evolutionary Algorithm for Many-Objective Optimization Problems

TL;DR: A hyperplane assisted evolutionary algorithm, referred here as hpaEA, is proposed which significantly outperforms the compared algorithms on 20 out of 36 benchmark instances and is compared with five state-of-the-art many- objective evolutionary algorithms on 36 many-objective benchmark instances.
Journal ArticleDOI

Comparative analysis and prediction of quorum-sensing peptides using feature representation learning and machine learning algorithms

TL;DR: A feature representation learning strategy that automatically learns the most discriminative features from existing feature descriptors in a supervised way is used, capable of effectively capturing the sequence determinants to represent the characteristics of QSPs, thereby contributing to the improved predictive performance.
Journal ArticleDOI

ELM-MHC: An Improved MHC Identification Method with Extreme Learning Machine Algorithm.

TL;DR: This paper proposed a new MHC recognition method compared with traditional biological methods and used the built classifier to classify and identify MHC I and MHC II and an online identification Web site named ELM-MHC.
Journal ArticleDOI

A Duplication Analysis-Based Evolutionary Algorithm for Biobjective Feature Selection

TL;DR: The proposed algorithm makes improvements on the basic dominance-based EA framework in three aspects: first, the reproduction process is modified to improve the quality of offspring; second, a duplication analysis method is proposed to filter out the redundant solutions; and third, a diversity-based selection method is adopted to select the reserved solutions.
References
More filters
Journal ArticleDOI

A fast and elitist multiobjective genetic algorithm: NSGA-II

TL;DR: This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
Book

Multi-Objective Optimization Using Evolutionary Algorithms

TL;DR: This text provides an excellent introduction to the use of evolutionary algorithms in multi-objective optimization, allowing use as a graduate course text or for self-study.
Journal ArticleDOI

MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition

TL;DR: Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjectives optimization problems.
Journal ArticleDOI

Muiltiobjective optimization using nondominated sorting in genetic algorithms

TL;DR: Goldberg's notion of nondominated sorting in GAs along with a niche and speciation method to find multiple Pareto-optimal points simultaneously are investigated and suggested to be extended to higher dimensional and more difficult multiobjective problems.
Journal ArticleDOI

An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints

TL;DR: A reference-point-based many-objective evolutionary algorithm that emphasizes population members that are nondominated, yet close to a set of supplied reference points is suggested that is found to produce satisfactory results on all problems considered in this paper.
Related Papers (5)