A Kind of Evolutionary Multi-Objective Optimization Algorithm Based on AIS

2013 ◽  
Vol 442 ◽  
pp. 419-423
Author(s):  
Ming Song Li
Keyword(s):  
Immune System ◽  
Optimization Algorithm ◽  
Clonal Selection ◽  
Research Area ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Objective Space ◽  
Speed Up ◽  
Important Research Area ◽  
Intelligent Information

Problem of multi-objective optimization based on Artificial Immune System (AIS) is an important research area of current evolutionary computing. Starting from the intelligent information processing mechanism of immune theory and the immune system itself, a kind of evolutionary multi-objective optimization algorithm based on AIS is proposed. Clonal selection, scattered crossover and hypermutation based on the learning mechanism are characteristics of the algorithm. Algorithm implements clonal selection according to the distribution of individuals in the objective space, which benefit obtaining Pareto optimal boundary distributed more widely and speed up the convergence. Compared with the existing algorithms, the algorithm has been greatly improved in convergence, diversity, and distribution of solutions.

Research of Evolutionary Multi-Objective Optimization Algorithm Model Based on AIS

2013 ◽  
Vol 442 ◽  
pp. 413-418
Author(s):  
Ming Song Li ◽  
Na Wang ◽  
Zhuo Hua Duan
Keyword(s):  
Immune System ◽  
Optimization Problem ◽  
Research Area ◽  
Multi Objective Optimization ◽  
Artificial Immune ◽  
Multi Objective ◽  
System A ◽  
Important Research Area ◽  
Intelligent Information ◽  
Processing Mechanism

Problem of multi-objective optimization based on Artificial Immune System (AIS) is an important research area of current evolutionary computing. Starting from the intelligent information processing mechanism of immune theory and the immune system itself, by researching the calculating model of immune evolution and Based on the biological mechanism of immune system, a general algorithm frame for solving optimization problem is proposed. The researching content has good theoretical value and practicability, also provides base for further research of specific type of problems.

Application of Multi-Objective Optimization Algorithm Based on Physical Programming in Ship Conceptual Design

2014 ◽  
Vol 904 ◽  
pp. 408-413
Author(s):  
Zhai Liu Hao ◽  
Zu Yuan Liu ◽  
Bai Wei Feng
Keyword(s):  
Conceptual Design ◽  
Optimization Algorithm ◽  
Optimization Design ◽  
Uniform Design ◽  
Multi Objective Optimization ◽  
Pareto Solutions ◽  
Physical Programming ◽  
Multi Objective ◽  
Objective Space ◽  
Preference Structures

Ship optimization design is a typical multi-objective problem. The multi-objective optimization algorithm based on physical programming is able to obtain evenly distributed Pareto front. But the number of Pareto solutions and the search positions of pseudo-preference structures still exit some disadvantages that are improved in this paper. Firstly uniform design for mixture experiments is used to arbitrarily set the number of Pareto solutions and evenly distribute the search positions of pseudo-preference structures. Then the objective space is searched by shrinking of search domain and rotation of pseudo-preference structure technology. The optimization quality is able to be improved. Finally, the improved multi-objective optimization algorithm is applied to ship conceptual design optimization and compared with the multi-objective evolutionary algorithm to verify the effectiveness of the improved algorithm.

Multi-Objective Optimization Based on Brain Storm Optimization Algorithm

2013 ◽  
Vol 4 (3) ◽  
pp. 1-21 ◽  
Author(s):  
Yuhui Shi ◽  
Jingqian Xue ◽  
Yali Wu
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Solution Space ◽  
Population Based ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Brain Storm Optimization ◽  
Objective Space ◽  
Different Characteristics ◽  
Single Objective

In recent years, many evolutionary algorithms and population-based algorithms have been developed for solving multi-objective optimization problems. In this paper, the authors propose a new multi-objective brain storm optimization algorithm in which the clustering strategy is applied in the objective space instead of in the solution space in the original brain storm optimization algorithm for solving single objective optimization problems. Two versions of multi-objective brain storm optimization algorithm with different characteristics of diverging operation were tested to validate the usefulness and effectiveness of the proposed algorithm. Experimental results show that the proposed multi-objective brain storm optimization algorithm is a very promising algorithm, at least for solving these tested multi-objective optimization problems.

scholarly journals A Comparison of Archiving Strategies for Characterization of Nearly Optimal Solutions under Multi-Objective Optimization

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 999
Author(s):  
Alberto Pajares ◽  
Xavier Blasco ◽  
Juan Manuel Herrero ◽  
Miguel A. Martínez
Keyword(s):  
Evolutionary Algorithms ◽  
Optimization Algorithm ◽  
Optimization Problem ◽  
Optimal Solutions ◽  
Multi Objective Optimization ◽  
Decision Space ◽  
Multi Objective ◽  
Objective Space ◽  
Excessive Number

In a multi-objective optimization problem, in addition to optimal solutions, multimodal and/or nearly optimal alternatives can also provide additional useful information for the decision maker. However, obtaining all nearly optimal solutions entails an excessive number of alternatives. Therefore, to consider the nearly optimal solutions, it is convenient to obtain a reduced set, putting the focus on the potentially useful alternatives. These solutions are the alternatives that are close to the optimal solutions in objective space, but which differ significantly in the decision space. To characterize this set, it is essential to simultaneously analyze the decision and objective spaces. One of the crucial points in an evolutionary multi-objective optimization algorithm is the archiving strategy. This is in charge of keeping the solution set, called the archive, updated during the optimization process. The motivation of this work is to analyze the three existing archiving strategies proposed in the literature (ArchiveUpdatePQ,ϵDxy, Archive_nevMOGA, and targetSelect) that aim to characterize the potentially useful solutions. The archivers are evaluated on two benchmarks and in a real engineering example. The contribution clearly shows the main differences between the three archivers. This analysis is useful for the design of evolutionary algorithms that consider nearly optimal solutions.

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

Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 129 ◽  
Author(s):  
Yan Pei ◽  
Jun Yu ◽  
Hideyuki Takagi
Keyword(s):  
Parameter Space ◽  
Statistical Tests ◽  
Distribution Characteristic ◽  
Multi Objective Optimization ◽  
Pareto Improvement ◽  
Pareto Solutions ◽  
Pareto Solution ◽  
Multi Objective ◽  
Objective Space ◽  
Convergence Point

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.

Sign in / Sign up

Export Citation Format

Share Document