Abstract
In the EMO (evolutionary multi-objective, EMO) algorithm, MaOPs (many objective optimization problems, MaOPs) are sometimes difficult to keep the balance of convergence and diversity. The decomposition based EMO developed for MaOPs has been proved to be effective, and BBO/Complex (the biogeography based optimization for complex system, BBO/Complex) algorithm is a low complexity algorithm. In this paper, a decomposition and adaptive weight adjustment based BBO/Complex algorithm (DAWA-BBO/Complex) for MaOPs is proposed. First, a new method based on crowding distance is designed to generate a set of weight vectors with good uniformly. Second, an adaptive weight adjustment method is used to solve MaOPs with complex Pareto optimal front. Subsystem space obtains a non-dominated solution by a new selection strategy. The experimental results show that the algorithm is superior to other new algorithms in terms of convergence and diversity in DTLZ benchmark problems. Finally, the algorithm is used to solve the problem of NC (numerical control machine, NC) cutting parameters, and the final optimization result is obtained by AHP (Analytic Hierarchy Process, AHP) method. The results show that the cutting speed is 10.8m/min, back cutting depth is 0.13mm, the cutting time is 504s and the cutting cost is 22.15yuan. The proposed algorithm can effectively solve the practical optimization problem.