Multimodal multiobjective problems (MMOPs) arise frequently in the real world, in which multiple Pareto-optimal solution (PS) sets correspond to the same point on the Pareto front. Traditional multiobjective evolutionary algorithms (MOEAs) show poor performance in solving MMOPs due to a lack of diversity maintenance in the decision space. Thus, recently, many multimodal MOEAs (MMEAs) have been proposed. However, for most existing MMEAs, the convergence performance in the objective space does not meet expectations. In addition, many of them cannot always obtain all equivalent Pareto solution sets. To address these issues, this study proposes an MMEA based on a weighted indicator, termed MMEA-WI. The algorithm integrates the diversity information of solutions in the decision space into an objective space performance indicator to maintain the diversity in the decision space and introduces a convergence archive to ensure a more effective approximation of the Pareto-optimal front (PF). These strategies can readily be applied to other indicator-based MOEAs. The experimental results show that MMEA-WI outperforms some state-of-the-art MMEAs on the chosen benchmark problems in terms of the inverted generational distance (IGD) and IGD in the decision space (IGDX) metrics.
2 March 2022 in IEEE Transactions on Evolutionary Computation
Multimodal multi-objective problems (MMOPs) commonly arise in real-world situations where distant solutions in decision space share a very similar objective value. Traditional multimodal multi-objective evolutionary algorithms (MMEAs) prefer to pursue multiple Pareto solutions that have the same objective values. However, a more practical situation in engineering problems is that one solution is slightly worse than another in terms of objective values, while the solutions are far away in the decision space. In other words, such problems have global and local Pareto fronts. In this study, we proposed several benchmark problems with several local Pareto fronts. Then, we proposed an evolutionary algorithm with a hierarchy ranking method (HREA) to find both the global and the local Pareto fronts based on the decision-maker’s preference. Regarding HREA, we proposed a local convergence quality evaluation method to better maintain diversity in the decision space. Moreover, a hierarchy ranking method was introduced to update the convergence archive. The experimental results show that HREA is competitive compared with other state-of-the-art MMEAs for solving the chosen benchmark problems.
15 June 2023 in IEEE/CAA Journal of Automatica Sinica
Most multimodal multi-objective evolutionary algorithms (MMEAs) aim to find all global Pareto optimal sets (PSs) for a multimodal multi-objective optimization problem (MMOP). However, in real-world problems, decision makers (DMs) may be also interested in local PSs. Also, searching for both global and local PSs is more general in view of dealing with MMOPs, which can be seen as generalized MMOPs. Moreover, most state-of-the-art MMEAs exhibit poor convergence on high-dimension MMOPs and are unable to deal with constrained MMOPs. To address the above issues, we present a novel multimodal multi-objective coevolutionary algorithm (CoMMEA) to better produce both global and local PSs, and simultaneously, to improve the convergence performance in dealing with high-dimension MMOPs. Specifically, the CoMMEA introduces two archives to the search process, and coevolves them simultaneously through effective knowledge transfer. The convergence archive assists the CoMMEA to quickly approach the Pareto optimal front. The knowledge of the converged solutions is then transferred to the diversity archive which utilizes the local convergence indicator and the $\epsilon$ -dominance-based method to obtain global and local PSs effectively. Experimental results show that CoMMEA is competitive compared to seven state-of-the-art MMEAs on fifty-four complex MMOPs.
Traditional Ecological Knowledge (TEK) is one of the components of the Globally Important Agricultural Heritage Systems (GIAHS), which are good examples of evolutionary adapted socio-ecosystems in human history. The Hani Rice Terraces System, located in China’s southwestern Yunnan Province, is a living example of GIAHS. The Hani Rice Terraces system has existed for more than one thousand years, following TEK related to cultivation and natural resources management, which was collected and practiced continually. Over this long time period, TEK has enabled the Hani people to manage their terraces and other natural resources in a sustainable way. This paper concentrates on the TEK transferring in the current Hani community, taking a small village, Mitian, as an example. Grouping the interviewees into three different age groups (young group, 0–30 years old; middle-age group, 31–50 years old; old group > 50 years old), we investigated their understanding and participation in 13 items of TEK in relation to rice cultivation and water utilization. The items of TEK were divided into four categories, namely “Festivals”, “Beliefs”, “Folk Songs”, and “Water Management”. From the data collected, it was learned that all the items of TEK are well known, but not necessarily practiced. Age and gender have significant influences on farmers’ understanding and participation in TEK. Our analysis suggested that both the knowledge and the practice showed declining trends from the older to the younger age group. Men and women behave differently in practices. In general, it is shown that TEK is declining in the Hani villages which will affect the rice terrace system in ways that are yet unknown. It is likely that a blended TEK, with old and new knowledge and practices, will emerge to sustain the upland rice terrace systems of Yunnan.
16 August 2022 in IEEE Transactions on Evolutionary Computation
Multi-objective orienteering problems (MO-OPs) are classical multi-objective routing problems and have received much attention in recent decades. This study seeks to solve MO-OPs through a problem-decomposition framework, that is, an MO-OP is decomposed into a multi-objective knapsack problem (MOKP) and a traveling salesman problem (TSP). The MOKP and TSP are then solved by a multi-objective evolutionary algorithm (MOEA) and a deep reinforcement learning (DRL) method, respectively. While the MOEA module is for selecting cities, the DRL module is for planning a Hamiltonian path for these cities. An iterative use of these two modules drives the population towards the Pareto front of MO-OPs. The effectiveness of the proposed method is compared against NSGA-II and NSGA-III on various types of MO-OP instances. Experimental results show that our method performs best on almost all the test instances, and has shown strong generalization ability.