A Double-Niched Evolutionary Algorithm and Its Behavior on Polygon-Based Problems

Abstract

Multi-modal multi-objective optimization problems are commonly seen in real-world applications. However, most existing researches focus on solving multi-objective optimization problems without multi-modal property or multi-modal optimization problems with single objective. In this paper, we propose a double-niched evolutionary algorithm for multi-modal multi-objective optimization. The proposed algorithm employs a niche sharing method to diversify the solution set in both the objective and decision spaces. We examine the behaviors of the proposed algorithm and its two variants as well as three other existing evolutionary optimizers on three types of polygon-based problems. Our experimental results suggest that the proposed algorithm is able to find multiple Pareto optimal solution sets in the decision space, even if the diversity requirements in the objective and decision spaces are inconsistent or there exist local optimal areas in the decision space.