Over the last three decades, a large number of evolutionary algorithms have been developed for solving multiobjective optimization problems. However, there lacks an up-to-date and comprehensive software platform for researchers to properly benchmark existing algorithms and for practitioners to apply selected algorithms to solve their real-world problems. The demand of such a common tool becomes even more urgent, when the source code of many proposed algorithms has not been made publicly available. To address these issues, we have developed a MATLAB platform for evolutionary multi-objective optimization in this paper, called PlatEMO, which includes more than 50 multi-objective evolutionary algorithms and more than 100 multi-objective test problems, along with several widely used performance indicators. With a user-friendly graphical user interface, PlatEMO enables users to easily compare several evolutionary algorithms at one time and collect statistical results in Excel or LaTeX files. More importantly, PlatEMO is completely open source, such that users are able to develop new algorithms on the basis of it. This paper introduces the main features of PlatEMO and illustrates how to use it for performing comparative experiments, embedding new algorithms, creating new test problems, and developing performance indicators.Source code of PlatEMO is now available at:
Abstract-The current literature of evolutionary manyobjective optimization is merely focused on the scalability to the number of objectives, while little work has considered the scalability to the number of decision variables. Nevertheless, many real-world problems can involve both many objectives and large-scale decision variables. To tackle such large-scale many-objective optimization problems, this paper proposes a specially tailored evolutionary algorithm based on a decision variable clustering method. To begin with, the decision variable clustering method divides the decision variables into two types: convergence-related variables and diversity-related variables. Afterwards, to optimize the two types of decision variables, a convergence optimization strategy and a diversity optimization strategy are adopted. In addition, a fast non-dominated sorting approach is developed to further improve the computational efficiency of the proposed algorithm. To assess the performance of the proposed algorithm, empirical experiments have been conducted on a variety of large-scale many-objective optimization problems with up to 10 objectives and 5000 decision variables. Our experimental results demonstrate that the proposed algorithm has significant advantages over several state-of-the-art evolutionary algorithms in terms of the scalability to decision variables on many-objective optimization problems.
Abstract-During the past two decades, a variety of multiobjective evolutionary algorithms (MOEAs) have been proposed in the literature. As pointed out in some recent studies, however, the performance of an MOEA can strongly depend on the Pareto front shape of the problem to be solved, whereas most existing MOEAs show poor versatility on problems with different shapes of Pareto fronts. To address this issue, we propose an MOEA based on an enhanced inverted generational distance indicator, in which an adaptation method is suggested to adjust a set of reference points based on the indicator contributions of candidate solutions in an external archive. Our experimental results demonstrate that the proposed algorithm is versatile for solving problems with various types of Pareto fronts, outperforming several state-of-the-art evolutionary algorithms for multi-objective and many-objective optimization.
In the real world, it is not uncommon to face an optimization problem with more than three objectives. Such problems, called many-objective optimization problems (MaOPs), pose great challenges to the area of evolutionary computation. received little attention. Several test problem suites which were designed for multi-objective optimization have still been dominantly used in many-objective optimization. In this paper, we carefully select (or modify) 15 test problems with diverse properties to construct a benchmark test suite, aiming to promote the research of evolutionary many-objective optimization (EMaO) via suggesting a set of test problems with a good representation of various real-world scenarios.Also, an open-source software platform with a user-friendly GUI is provided to facilitate the experimental execution and data observation.
Constrained multi-objective optimization problems (CMOPs) are challenging because of the difficulty in handling both multiple objectives and constraints. While some evolutionary algorithms have demonstrated high performance on most CMOPs, they exhibit bad convergence or diversity performance on CMOPs with small feasible regions. To remedy this issue, this paper proposes a coevolutionary framework for constrained multi-objective optimization, which solves a complex CMOP assisted by a simple helper problem. The proposed framework evolves one population to solve the original CMOP and evolves another population to solve a helper problem derived from the original one. While the two populations are evolved by the same optimizer separately, the assistance in solving the original CMOP is achieved by sharing useful information between the two populations. In the experiments, the proposed framework is compared to several state-of-the-art algorithms tailored for CMOPs. High competitiveness of the proposed framework is demonstrated by applying it to 47 benchmark CMOPs and the vehicle routing problem with time windows.
Abstract-Both convergence and diversity are crucial to evolutionary many-objective optimization, whereas most existing dominance relations show poor performance in balancing them, thus easily leading to a set of solutions concentrating on a small region of the Pareto fronts. In this paper, a novel dominance relation is proposed to better balance convergence and diversity for evolutionary manyobjective optimization. In the proposed dominance relation, an adaptive niching technique is developed based on the angles between the candidate solutions, where only the best converged candidate solution is identified to be nondominated in each niche. Experimental results demonstrate that the proposed dominance relation outperforms existing dominance relations in balancing convergence and diversity. A modified NSGA-II is suggested based on the proposed dominance relation, which shows competitiveness against the state-of-the-art algorithms in solving many-objective optimization problems. The effectiveness of the proposed dominance relation is also verified on several other existing multi-and many-objective evolutionary algorithms.
Surrogate-assisted evolutionary algorithms have been developed mainly for solving expensive optimization problems where only a small number of real fitness evaluations are allowed. Most existing surrogate-assisted evolutionary algorithms are designed for solving low-dimensional single or multiobjective optimization problems, which are not well suited for many-objective optimization. This paper proposes a surrogateassisted many-objective evolutionary algorithm that uses an artificial neural network to predict the dominance relationship between candidate solutions and reference solutions instead of approximating the objective values separately. The uncertainty information in prediction is taken into account together with the dominance relationship to select promising solutions to be evaluated using the real objective functions. Our simulation results demonstrate that the proposed algorithm outperforms the state-of-the-art evolutionary algorithms on a set of manyobjective optimization test problems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.