There are lots of many-objective optimization problems (MaOPs) in real-world applications, which often have many decision variables. Although a variety of methods have been proposed to solve MaOPs, with the increasing number of decision variables or objective functions, the performance of these algorithms deteriorates appreciably. In view of this, the paper proposes a method to solve large-scale MaOPs (LSMaOPs) based on dimension reduction and a solving knowledge guided evolutionary algorithm. First, a dimension reduction method of objective functions is proposed. By clustering and aggregating the objective functions based on their correlation, the dimension of the original LSMaOP is effectively reduced. In addition, the correlations between the reduced objective functions are relatively low, so they can better represent different preferences. Then, we propose a solving knowledge guided evolutionary algorithm to solve the transformed LSMaOP. In order to get a better set of initial solutions, a population initialization method by mirror partitioning the decision space is given, in which we dynamically modify the sampling probability according to the performance of solutions contained in each sub-domain. At the same time, the algorithm will continuously supplement new excellent individuals using the solving knowledge obtained in the evolution of the population. To examine the performance of the proposed method, we carried out a number of comparative experiments. The experimental results demonstrated that the proposed algorithm can effectively tackle LSMaOPs.
26 August 2022 in IEEE Transactions on Evolutionary Computation
The decomposition-based multi-objective optimization algorithm (MOEA/D) is an effective method of solving a multi-objective optimization problem (MOP). The main idea of MOEA/D is that the objectives are weighted through different vectors to form different subproblems, and an optimal solution set is obtained by co-evolution in a certain neighborhood. However, with the increase of objectives, the number of non-dominated solutions increases exponentially, resulting in the deteriorated capability of searching for optimal solutions. In addition, for an optimization problem with the complex Pareto front(PF), the selection pressure of non-dominated solutions is insufficient. To make evolution more efficient, a decomposition-based multi-objective optimization algorithm with adaptively adjusting weight vectors and neighborhoods (MOEA/D-AAWN) is developed in this paper. Firstly, the evolutionary direction of each subproblem is analyzed and the Sparsity function (Spa) is proposed to measure the population density on the PF. By using Spa, a method of generating uniform vectors is presented to improve the diversity of solutions. Besides, a method of adaptively adjusting neighborhoods is given. It adjusts neighborhoods according to the number of iterations and the Spa value of its corresponding subproblem. In this way, the computational resource can be effectively allocated, leading to the improvement in evolutionary efficiency. The proposed algorithm is applied to solve a series of benchmark optimization instances, and the experimental results show that the proposed algorithm outperforms comparison algorithms in runtime, convergence, and diversity.
19 January 2021 in IEEE Transactions on Software Engineering
Mutation testing, a fundamental software testing technique, which is a typical way to evaluate the adequacy of a test suite. In mutation testing, a set of mutants are generated by seeding the different classes of faults into a program under test. Test data shall be generated in the way that as many mutants can be killed as possible. Thanks to numerous tools to implement mutation testing for different languages, a huge amount of mutants are normally generated even for small-sized programs. However, a large number of mutants not only leads to a high cost of mutation testing, but also make the corresponding test data generation a non-trivial task. In this paper, we make use of intelligent technologies to improve the effectiveness and efficiency of mutation testing from two perspectives. A machine learning technique, namely fuzzy clustering, is applied to categorize mutants into different clusters. Then, a multi-population genetic algorithm via individual sharing is employed to generate test data for killing the mutants in different clusters in parallel when the problem of test data generation as an optimization one. A comprehensive framework, termed as $\mathbf {FUZGENMUT}$ , is thus developed to implement the proposed techniques. The experiments based on nine programs of various sizes show that fuzzy clustering can help to reduce the cost of mutation testing effectively, and that the multi-population genetic algorithm improves the efficiency of test data generation while delivering the high mutant-killing capability. The results clearly indicate that the huge potential of using intelligent technologies to enhance the efficacy and thus the practicality of mutation testing.
16 October 2014 in Computational Intelligence and Neuroscience
The application of genetic algorithms in automatically generating test data has aroused broad concerns and obtained delightful achievements in recent years. However, the efficiency of genetic algorithm-based test data generation for path testing needs to be further improved. In this paper, we establish a mathematical model of generating test data for multiple paths coverage. Then, a multipopulation genetic algorithm with individual sharing is presented to solve the established model. We not only analyzed the performance of the proposed method theoretically, but also applied it to various programs under test. The experimental results show that the proposed method can improve the efficiency of generating test data for many paths’ coverage significantly.
Most existing constrained multi-objective evolutionary algorithms (CMOEAs) experience a dramatic performance degradation when solving large-scale constrained multi-objective optimization problems (LSCMOPs), since they converge very slowly and easily get trapped in local optima due to the loss of diversity. To enhance the efficiency of tackling LSCMOPs, this paper proposes an indicator-based evolutionary algorithm, referred to as ILCMO. In ILCMO, two complementary indicators are proposed to assess the contribution of each individual to feasibility, convergence, and diversity. The first is a feasibility-oriented indicator designed to drive the population towards the feasible regions. The second is an infeasibility-assisted dynamic indicator, which comprises two relaxed constraint boundaries. Theoretical studies demonstrate that this dynamic indicator can effectively guide the population to focus on evenly searching the infeasible regions around feasible solutions to enhance local diversity. In addition, a variable grouping-based differential evolution (VGDE) strategy, which includes a group-based intra-learning operator and a group-based inter-learning operator, is devised to improve the quality of reproduction in large-scale search spaces. The effectiveness of the proposed algorithm is validated through comprehensive experiments on four benchmarks and a microgrid dispatch problem against seven state-of-the-art algorithms.