Latest Stored Information Based Adaptive Selection Strategy for Multiobjective Evolutionary Algorithm

Decomposition-based multi-objective evolutionary algorithms (MOEAs) are widely utilized for solving multi-objective optimization problems (MOPs), while having the problem of striking a balance between exploration and exploitation. To address this issue, many efforts have focused on adaptive operator selection mechanisms that automatically choose the most appropriate operator according to the improvement of the evolutionary population. However, real-world MOPs typically feature objectives with varying scales. Existing operator selection mechanisms struggle with such scaled MOPs, since most, if not all, of the improvement calculation does not consider the scales of objectives. This article introduces a novel adaptive operator selection mechanism designed for scaled problems. Specifically, a multi-bandit learning model is formulated, where each arm represents a reproduction operator and is assigned a prior reward distribution. These rewards are calculated based on the normalized objective values, and the operator (arm) with the highest reward is selected to generate an offspring. Experimental results comprehensively demonstrate the effectiveness and competitiveness of the proposed mechanism on scaled problems, compared with eight well-established MOEAs.

The selection of products for testing Software Product Lines (SPLs) is an optimization problem. The goal is to select a possible minimum set of products that satisfies testing criteria, such as, pairwise and mutation testing. Multi-objective Evolutionary Algorithms (MOEAs) have been successfully used to solve this problem and other ones related to software development. However, the use of MOEAs demands setting a number of control parameters and selection of genetic operators, to which the algorithm performance is often very sensitive. Adaptive Operator Selection (AOS) methods, such as Upper Confidence Bound (UCB) based ones can help in this task. UCB methods used with Multi-objective Evolutionary Algorithm Based on Decomposition with Dynamical Resource Allocation (MOEA/D-DRA) have presented promising results, but they are underexplored in the Search Based Software Engineering (SBSE) field. To contribute to this research area and to solve efficiently the product selection problem, this paper investigates the use of different AOS UCB-based methods with MOEA/D-DRA. The idea is to reduce effort spent by the tester. Some parameters and evolutionary operators can be automatically set. The approach is empirical evaluated using four instances and three UCB methods. The UCB methods present similar results and outperform the canonical version of MOEA/D-DRA.

The Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) is a popular algorithm for solving Multi-Objective Problems (MOPs). The main component of MOEA/D is to decompose a MOP into easier sub-problems using a set of weight vectors. The choice of the number of weight vectors significantly impacts the performance of MOEA/D. However, the right choice for this number varies, given different MOPs and search stages. We adaptively change the number of vectors by removing unnecessary vectors and adding new ones in empty areas of the objective space. Our MOEA/D variant uses the Consolidation Ratio to decide when to change the number of vectors and to decide where to add or remove these weighted vectors. We investigate the effects of this adaptive MOEA/D against MOEA/D with a poorly chosen set of vectors, a MOEA/D with fine-tuned vectors and MOEA/D with Adaptive Weight Adjustment on two commonly used benchmark functions. We analyse the algorithms in terms of hypervolume, IGD and entropy performance. Our results show that the proposed method is equivalent to MOEA/D with fine-tuned vectors and superior to MOEA/D with poorly defined vectors. Thus, our adaptive mechanism mitigates problems related to the choice of the number of weight vectors in MOEA/D, increasing the final performance of MOEA/D by filling empty areas of the objective space and avoiding premature stagnation of the search progress.

A Multiobjective Optimization Problem (MOP) requires the optimization of several objective functions simultaneously, usually in conflict with each other. One of the most efficient algorithms for solving MOPs is MOEA/D (Multiobjective Evolutionary Algorithm Based on Decomposition), which decomposes a MOP into single-objective optimization subproblems and solves them using information from neighboring subproblems. MOEA/D variants with other evolutionary operators have emerged over the years, improving their efficiency in various MOPs. Recently, the IWOA (Improved Whale Optimization Algorithm) was proposed, an optimization algorithm bioinspired by the whale hunting method hybridized with Differential Evolution, which presented excellent results in single-objective optimization problems. This work proposes the MOEA/D-IWOA algorithm, which associates characteristics of the evolutionary operators of the IWOA to MOEA/D. Computational experiments were accomplished to analyze the performance of the MOEA/D-IWOA in benchmark MOPs suites. The results were compared with those obtained by the MOEA/D, Non-dominated Sorting Genetic Algorithm II (NSGA-II), Third Evolution Step of Generalized Differential Evolution (GDE3), Improving the Strength Pareto Evolutionary Algorithm (SPEA2), and Indicator-Based Evolutionary Algorithm (IBEA) algorithms in the Hypervolume and Inverted Generational Distance Plus (IGD+) indicators. The MOEA/D-IWOA proved to be competitive, with a good performance profile, in addition to presenting the best results in some POMs.

Multiobjective evolutionary algorithms based on decomposition (MOEA/D) decompose a multiobjective optimization problem (MOP) into a group of subproblems and optimizes them at the same time. The reproduction method in MOEA/D, which generates offspring solutions, has crucial effect on the performance of algorithm. As the difficulties of MOPs increases, it requires much higher efficiency for the reproduction methods in MOEA/D. However, for the complex optimization problems whose PS shape is complicated, the original reproduction method used in MOEA/D might not be suitable to generate excellent offspring solutions. In order to improve the property of the reproduction method for MOEA/D, this paper proposes an external archive matching strategy which selects solutions’ most matching archive solutions as parent solutions. The offspring solutions generated by this strategy can maintain a good convergence ability. To balance convergence and diversity, a perturbed learning scheme is used to extend the search space of the solutions. The experimental results on three groups of test problems reveal that the solutions obtained by MOEA/D-EAM have better convergence and diversity than the other four state-of-the-art algorithms.

Given that the definition of the multi-objective optimization problem is raised when number of objectives is increased in number at the optimization problem, where not only the number of objectives but also the computational resources which are needed to solve the problem, is also more desired. Therefore, novel approaches had required to solve multi-objective optimization problem in a reasonable time. One of this novel approach is utilization of the decomposition method with the evolutionary algorithm/operator. This algorithm was called multi-objective evolutionary algorithm based on decomposition (MOEA/D). Later on, variants have been proposed to improve the performance of the MOEA/D algorithm. However, a general comparison between these variants has needed for demonstrate the performance of these algorithm. For this reason, in this research the variants of MOEA/D algorithms have implemented on benchmark problems (DTLZ and MaF) and the performances has compared with each other. Two metrics had selected to evaluate/compare the performances of the variants. The metrics are IGD and Spread metrics. The results at the end of the implementations suggest that adaptive weighting idea is the most promising idea to increase the performance of the MOEA/D algorithm.

There are a large number of multi-objective optimization problems in real-world applications, like in games, that need to be solved in real time. In order to meet this pressing need, we suggests a method of parallelizing the multi-objective evolutionary algorithm based on decomposition (MOEA/D). Furthermore, a novel task decomposition strategy and scalarizing method without the ideal point are proposed for meeting the requirements of real-time and precision of the game. By combining the novel scalarizing function and GPU-based CUDA technology with the MOEA/D, a parallel MOEA/D for real-time multi-objective optimization problems is developed, namely P-MOEA/D. Experimental studies on ZDT and DTLZ benchmark problems suggest that the P-MOEA/D algorithm is efficient and fast.

This paper presents adaptive routing selection strategies suitable for network-on-chip (NoC). The main prototype presented in this paper uses contention information and bandwidth space occupancy to make routing decision at runtime during application execution time. The performance of the NoC router is compared to other NoC routers with queue-length-oriented adaptive routing selection strategies. The evaluation results show that the contention- and bandwidth-aware adaptive routing selection strategies are better than the queue-length-oriented adaptive selection strategies. Messages in the NoC are switched with a wormhole cut-through switching method, where different messages can be interleaved at flit-level in the same communication link without using virtual channels. Hence, the head-of-line blocking problem can be solved effectively and efficiently. The routing control concept and the VLSI microarchitecture of the NoC routers are also presented in this paper.

Multi-objective Estimation of Distribution Algorithms (MOEDAS) have been successfully applied to solve Multi-objective Optimization Problems (MOPs) since they are able to model dependencies between variables of the problem and then sample new solutions to guide the search to promising areas. A state-of-the-art optimizer for single-objective continuous functions that also uses probabilistic modeling is the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). Different variants of CMA-ES have been proposed for MOPs however most of them are based on Pareto dominance as the main selection criterion. Recently, a new multi-objective CMA-ES called MOEA/D-CMA was proposed combining the strengths of CMA-ES with those of the multi-objective evolutionary algorithm based on decomposition (MOEA/D). Nowadays, however, researchers on MOEAs agree that combining Pareto and decomposition can be beneficial for the search on MOPs. As a result, a new MOEA has been proposed, called MOEA/DD. This algorithm modifies the MOEA/D by including a new Pareto dominance update mechanism that brings more diversity into the search. In this study, we extend the MOEA/D-CMA by replacing its update mechanism by the one of MOEA/DD. The hypothesis is that this update mechanism will improve the performance of MOEA/D-CMA as it improved MOEA/D. MOEA/D-CMA and MOEA/DD-CMA are implemented and evaluated through an experimental study. The experimental study involves two well-known families of benchmark problems whose objective numbers scale from two to fifteen. Then, an extensive statistical analysis of the results is made to extract sound, statistically supported conclusions about the performance of the algorithms as the number of objectives scales.

Wireless sensor networks design requires high quality location assignment and energy efficient power assignment for maximizing the network coverage and lifetime. Classical deployment and power assignment approaches optimize these two objectives individually or by combining them together in a single objective or by constraining one and optimizing the other. In this article a multi-objective deployment and power assignment problem (DPAP) is formulated and a multi-objective evolutionary algorithm based on decomposition (MOEA/D) is specialized. Following the MOEA/D's framework the above multiobjective optimization problem (MOP) is decomposed into many scalar single objective problems. The sub-problems are solved simultaneously by using neighborhood information. Additionally, unique problem-specific, parameter-rising, genetic operators and local search heuristics were designed specifically for the DPAP. In addition, a new encoding scheme is designed to represent a WSN based on the DPAP's design variables. Simulation results show that MOEA/D provides a high quality set of alternative solutions without any prior knowledge on the objectives preference.

A new resource allocation strategy based on the relationship between subproblems for MOEA/D

To obtain propellant formulations with superior comprehensive and robustness performance, the study establishes a multi-objective optimization model that accounts for uncertainties. The model adopts a bi-layer structure. The inner layer computes performance bounds to construct uncertainty intervals, which are subsequently transformed into deterministic performance via interval order relations. The outer layer optimizes component mass fractions using MOEA/D (Multi-objective Evolutionary Algorithm Based on Decomposition) to maximize the deterministic performance. The study leverages Large Language Models (LLMs) as pre-trained optimizers to automate the operator design of MOEA/D. Designers can identify formulations that satisfy the performance requirements and robustness criteria by adjusting uncertainty levels and MOEA/D weight coefficients. The results on ZDTs and UFs demonstrate that MOEA/D-LLM achieves approximately a 4.0% improvement in hypervolume values compared to MOEA/D. Additionally, the NEPE propellant optimization case shows that MOEA/D-LLM improves the computational speed by about 13.05% and enhances hypervolume values by around 2.7% compared to MOEA/D. The specific impulse increases by 1.11%, the generation of aluminum oxide and hydrogen chloride decreases by approximately 18.43% and 16.40%, respectively, and the impact sensitivity is reduced by about 1.67%.

Design of multi-band antenna involves multiple characteristics such as return loss in multiple operation bands. To apply MOEA/D (multi-objective evolutionary algorithm based on decomposition) to antenna structure optimization, it was introduced into this field for the first time. MOEA/D framework was demonstrated at first. Then it was in conjunction with electromagnetic solver, HFSS (high frequency structure simulator) to optimize and design tri-band bow-tie antenna to serve as an example. The evolutionary results showed that MOEA/D worked efficiently and generated multiple candidate structures at one single iteration, and that MOEA/D had lower computational overhead than NSGA-II (non-dominated sorting genetic algorithm II) for this problem. Therefore, MOEA/D shows great potential for antenna structure optimization and design.

The Markowitz mean-variance (MV) model is the basis of modern portfolio theory, the goal of which is to choose an optimal set of weights with the maximum expected return for a given level of risk. However, the MV model assumes that returns are normally distributed, which ignores the asymmetry of returns in real life. The mean-variance-skewness (MVS) portfolio framework introduces the skewness of the return as an extension of the classical MV model. Because of the increasing conflicting objective functions, the multi-objective portfolio optimization problem is more difficult to solve. This paper investigates the use of a multi-objective evolutionary algorithm based on decomposition (MOEA/D) for solving the portfolio optimization problem in the stock market. The results show that MOEA/D can produce Pareto fronts efficiently with three objectives to be optimized.

A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows