As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
In MMOP there are some algorithms that are difficult to find more equivalent Pareto optimal solutions,and unable to balance the performance of solutions in decision space and objective space. In addition, the solution is too densely distributed on the boundary. A multimodal multi-objective differential evolution algorithm based on hybrid strategy (MMODE_HS) is proposed to solve above these problems. First, an effective binary tournament selection mechanism based on special crowding distance is designed to select individuals which performance better diversity in decision space and objective space and balance the performance of the solution in two spaces; Second, The reverse vector mutation strategy is introduced to reduce the quantity of boundary point, which can help the algorithm improve the distribution of Pareto subsets. MMODE_HS is compared with other multimodal multi-objective evolutionary algorithms, the results demonstrate that the proposed algorithm can search for more complete Pareto subsets on nine test problems, and effectively balance convergence and diversity.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.