Next Article in Journal
Equilibrium and Stability of Entropy Operator Model for Migratory Interaction of Regional Systems
Next Article in Special Issue
A Novel Bat Algorithm with Multiple Strategies Coupling for Numerical Optimization
Previous Article in Journal
SUPG Approximation for the Oseen Viscoelastic Fluid Flow with Stabilized Lowest-Equal Order Mixed Finite Element Method
Previous Article in Special Issue
The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm
Article

Search Acceleration of Evolutionary Multi-Objective Optimization Using an Estimated Convergence Point

by 1,*, 2 and 3
1
Computer Science Division, University of Aizu, Aizuwakamatsu 965-8580, Japan
2
Graduate School of Design, Kyushu University, Fukuoka 815-8540, Japan
3
Faculty of Design, Kyushu University, Fukuoka 815-8540, Japan
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(2), 129; https://doi.org/10.3390/math7020129
Received: 21 November 2018 / Revised: 23 January 2019 / Accepted: 23 January 2019 / Published: 28 January 2019
(This article belongs to the Special Issue Evolutionary Computation)
We propose a method to accelerate evolutionary multi-objective optimization (EMO) search using an estimated convergence point. Pareto improvement from the last generation to the current generation supports information of promising Pareto solution areas in both an objective space and a parameter space. We use this information to construct a set of moving vectors and estimate a non-dominated Pareto point from these moving vectors. In this work, we attempt to use different methods for constructing moving vectors, and use the convergence point estimated by using the moving vectors to accelerate EMO search. From our evaluation results, we found that the landscape of Pareto improvement has a uni-modal distribution characteristic in an objective space, and has a multi-modal distribution characteristic in a parameter space. Our proposed method can enhance EMO search when the landscape of Pareto improvement has a uni-modal distribution characteristic in a parameter space, and by chance also does that when landscape of Pareto improvement has a multi-modal distribution characteristic in a parameter space. The proposed methods can not only obtain more Pareto solutions compared with the conventional non-dominant sorting genetic algorithm (NSGA)-II algorithm, but can also increase the diversity of Pareto solutions. This indicates that our proposed method can enhance the search capability of EMO in both Pareto dominance and solution diversity. We also found that the method of constructing moving vectors is a primary issue for the success of our proposed method. We analyze and discuss this method with several evaluation metrics and statistical tests. The proposed method has potential to enhance EMO embedding deterministic learning methods in stochastic optimization algorithms. View Full-Text
Keywords: evolutionary multi-objective optimization; convergence point; acceleration search; evolutionary computation; optimization evolutionary multi-objective optimization; convergence point; acceleration search; evolutionary computation; optimization
Show Figures

Figure 1

MDPI and ACS Style

Pei, Y.; Yu, J.; Takagi, H. Search Acceleration of Evolutionary Multi-Objective Optimization Using an Estimated Convergence Point. Mathematics 2019, 7, 129. https://doi.org/10.3390/math7020129

AMA Style

Pei Y, Yu J, Takagi H. Search Acceleration of Evolutionary Multi-Objective Optimization Using an Estimated Convergence Point. Mathematics. 2019; 7(2):129. https://doi.org/10.3390/math7020129

Chicago/Turabian Style

Pei, Yan, Jun Yu, and Hideyuki Takagi. 2019. "Search Acceleration of Evolutionary Multi-Objective Optimization Using an Estimated Convergence Point" Mathematics 7, no. 2: 129. https://doi.org/10.3390/math7020129

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop