scholarly journals An Evolutionary Algorithm with Clustering-Based Assisted Selection Strategy for Multimodal Multiobjective Optimization

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Naili Luo ◽  
Wu Lin ◽  
Peizhi Huang ◽  
Jianyong Chen

In multimodal multiobjective optimization problems (MMOPs), multiple Pareto optimal sets, even some good local Pareto optimal sets, should be reserved, which can provide more choices for decision-makers. To solve MMOPs, this paper proposes an evolutionary algorithm with clustering-based assisted selection strategy for multimodal multiobjective optimization, in which the addition operator and deletion operator are proposed to comprehensively consider the diversity in both decision and objective spaces. Specifically, in decision space, the union population is partitioned into multiple clusters by using a density-based clustering method, aiming to assist the addition operator to strengthen the population diversity. Then, a number of weight vectors are adopted to divide population into N subregions in objective space (N is population size). Moreover, in the deletion operator, the solutions in the most crowded subregion are first collected into previous clusters, and then the worst solution in the most crowded cluster is deleted until there are N solutions left. Our algorithm is compared with other multimodal multiobjective evolutionary algorithms on the well-known benchmark MMOPs. Numerical experiments report the effectiveness and advantages of our proposed algorithm.

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Cai Dai ◽  
Yuping Wang

In order to well maintain the diversity of obtained solutions, a new multiobjective evolutionary algorithm based on decomposition of the objective space for multiobjective optimization problems (MOPs) is designed. In order to achieve the goal, the objective space of a MOP is decomposed into a set of subobjective spaces by a set of direction vectors. In the evolutionary process, each subobjective space has a solution, even if it is not a Pareto optimal solution. In such a way, the diversity of obtained solutions can be maintained, which is critical for solving some MOPs. In addition, if a solution is dominated by other solutions, the solution can generate more new solutions than those solutions, which makes the solution of each subobjective space converge to the optimal solutions as far as possible. Experimental studies have been conducted to compare this proposed algorithm with classic MOEA/D and NSGAII. Simulation results on six multiobjective benchmark functions show that the proposed algorithm is able to obtain better diversity and more evenly distributed Pareto front than the other two algorithms.


2019 ◽  
Vol 2019 ◽  
pp. 1-17
Author(s):  
Peng Xu ◽  
Xiaoming Wu ◽  
Man Guo ◽  
Shuai Wang ◽  
Qingya Li ◽  
...  

There are many issues to consider when integrating 5G networks and the Internet of things to build a future smart city, such as how to schedule resources and how to reduce costs. This has a lot to do with dynamic multiobjective optimization. In order to deal with this kind of problem, it is necessary to design a good processing strategy. Evolutionary algorithm can handle this problem well. The prediction in the dynamic environment has been the very challenging work. In the previous literature, the location and distribution of PF or PS are mostly predicted by the center point. The center point generally refers to the center point of the population in the decision space. However, the center point of the decision space cannot meet the needs of various problems. In fact, there are many points with special meanings in objective space, such as ideal point and CTI. In this paper, a hybrid prediction strategy carried through from both decision space and objective space (DOPS) is proposed to handle all kinds of optimization problems. The prediction in decision space is based on the center point. And the prediction in objective space is based on CTI. In addition, for handling the problems with periodic changes, a kind of memory method is added. Finally, to compensate for the inaccuracy of the prediction in particularly complex problems, a self-adaptive diversity maintenance method is adopted. The proposed strategy was compared with other four state-of-the-art strategies on 13 classic dynamic multiobjective optimization problems (DMOPs). The experimental results show that DOPS is effective in dynamic multiobjective optimization.


Axioms ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 32 ◽  
Author(s):  
Benjamín Barán ◽  
Marcos Villagra

In this work we show how to use a quantum adiabatic algorithm to solve multiobjective optimization problems. For the first time, we demonstrate a theorem proving that the quantum adiabatic algorithm can find Pareto-optimal solutions in finite-time, provided some restrictions to the problem are met. A numerical example illustrates an application of the theorem to a well-known problem in multiobjective optimization. This result opens the door to solve multiobjective optimization problems using current technology based on quantum annealing.


2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Zhigang Lu ◽  
Tao Feng ◽  
Zhaozheng Liu

Bacterial colony chemotaxis algorithm was originally developed for optimal problem with continuous space. In this paper the discrete bacterial colony chemotaxis (DBCC) algorithm is developed to solve multiobjective optimization problems. The basic DBCC algorithm has the disadvantage of being trapped into the local minimum. Therefore, some improvements are adopted in the new algorithm, such as adding chaos transfer mechanism when the bacterium choose their next locations and the crowding distance operation to maintain the population diversity in the Pareto Front. The definition of chaos transfer mechanism is used to retain the elite solution produced during the operation, and the definition of crowding distance is used to guide the bacteria for determinate variation, thus enabling the algorithm obtain well-distributed solution in the Pareto optimal set. The convergence properties of the DBCC strategy are tested on some test functions. At last, some numerical results are given to demonstrate the effectiveness of the results obtained by the new algorithm.


Sign in / Sign up

Export Citation Format

Share Document