An improved NSGA-III algorithm with adaptive mutation operator for Big Data optimization problems

Abstract

One of the major challenges of solving Big Data optimization problems via traditional multi-objective evolutionary algorithms (MOEAs) is their high computational costs. This issue has been efficiently tackled by non-dominated sorting genetic algorithm, the third version, (NSGA-III). On the other hand, a concern about the NSGA-III algorithm is that it uses a fixed rate for mutation operator. To cope with this issue, this study introduces an adaptive mutation operator to enhance the performance of the standard NSGA-III algorithm. The proposed adaptive mutation operator strategy is evaluated using three crossover operators of NSGA-III including simulated binary crossover (SBX), uniform crossover (UC) and single point crossover (SI). Subsequently, three improved NSGA-III algorithms (NSGA-III SBXAM, NSGA-III SIAM, and NSGA-III UCAM) are developed. These enhanced algorithms are then implemented to solve a number of Big Data optimization problems. Experimental results indicate that NSGA-III with UC and adaptive mutation operator outperforms the other NSGA-III algorithms.