A Directed Search Many Objective Optimization Algorithm Embodied with Kernel Clustering Strategy
Abstract
With the vast existence of multi-objective optimization problems to the scientific research and engineering applications, Many-objective Evolutionary Algorithms (MaOEAs) demand to systematically perpetuate population diversity and convergence distributions in the objective space with high dimensionality. To fulfill the balance in the relationship between convergence, distributions, and diversity, this paper proposes a directed search many-objective optimization algorithm embodied with kernel clustering strategy (DSMOA-KCS) in decision space where some mechanisms such as adaptive environmental selection which efficiently assimilates design for control of diversity and convergence in the distribution of the solutions in the decision scopes. DSMOA-KCS is a stochastic, multi-start algorithm using clustering to increase efficiency. DSMOA-KCS finds the starting point in the regions of interest. Then, it improves them by the directed search method. DSMOA-KCS is compared with several existing state-of-the-art algorithms (NSGA-III, RSEA, and MOEADPas) on many-objective problems with 5 to 30 objective functions using the Inverted Generational Distance (IGD) performance metric. DSMOA-KCS evaluation results illustrate that it is competitive and promising, performing better with some problems. Then, even distribution, convergence, and diversity are maintained.