An Evolutionary Algorithm with Double-Level Archives for Multiobjective Optimization

Abstract

Existing multiobjective evolutionary algorithms (MOEAs) tackle a multiobjective problem either as a whole or as several decomposed single-objective sub-problems. Though the problem decomposition approach generally converges faster through optimizing all the sub-problems simultaneously, there are two issues not fully addressed, i.e., distribution of solutions often depends on a priori problem decomposition, and the lack of population diversity among sub-problems. In this paper, a MOEA with double-level archives is developed. The algorithm takes advantages of both the multiobjective-problem-level and the sub-problem-level approaches by introducing two types of archives, i.e., the global archive and the sub-archive. In each generation, self-reproduction with the global archive and cross-reproduction between the global archive and sub-archives both breed new individuals. The global archive and sub-archives communicate through cross-reproduction, and are updated using the reproduced individuals. Such a framework thus retains fast convergence, and at the same time handles solution distribution along Pareto front (PF) with scalability. To test the performance of the proposed algorithm, experiments are conducted on both the widely used benchmarks and a set of truly disconnected problems. The results verify that, compared with state-of-the-art MOEAs, the proposed algorithm offers competitive advantages in distance to the PF, solution coverage, and search speed.

Fault Tolerant Dynamic Task Offloading with Cloudlets in Mobile Cloud Computing

“…There are various planning ways to deal with take care of the generally standard issues in distributed computing [29][30][31]. The calculations have the ability to take care of the substantial issues and changing over them into sensible enhancement issues through direct programming [32], whole number straight programming [34], and number programming [33].…”

A Decomposition‐Based Multiobjective Evolutionary Algorithm with Adaptive Weight Adjustment

“…Step 4: Set gen = gen + 1 end while Pseudocode 1: The pseudocode of the algorithm IMOEA/DA. 6 Complexity IGD, GD, and HV of the compared algorithms. It tests whether the performance of IMOEA/DA on each test problem is better ("+"), same ("="), or worse ("−") than/as that of the compared algorithms at a significance level of 0.05 by a two-tailed test.…”

“…It has a good performance of solving the MOPs with complex PFs. IMOEA/DA is compared with MOEA/D-AWA and EMOSA on fourteen test problems which include five ZDT problems, five DTLZ problems, two constructed problems F1-F2, and two many-objective problems DTLZ4(3,6) and DTLZ5 (3,6). In this experiment, EMOSA does not test many-objective problems DTLZ4(3,6) and DTLZ5 (3,6).…”

A novel evolutionary root system growth algorithm for solving multi-objective optimization problems

“…The Chebyshev approach is used to normalize each objective function value of all M objective functions [34,35]. Then, for each objective function f i (x), its normalization is defined as…”