Non-dominated sorting genetic algorithm (NSGA-II) has been widely used in the field of multi-objective optimization after introducing sorting algorithm
crowding degree operator and elite strategy
but there are also problems such as uneven distribution of individual and Pareto efficiency. The algorithm is improved for these defects. Firstly
a cumulative non-dominated ranking assignment strategy is proposed to improve the crossover operator. The DE algorithm with adaptive parameters is used to improve the initial population and the population diversity; Then introduce the idea of nonlinear algorithm to improve the local search ability and further improve the quality of Pareto optimal solution. Finally
six benchmark multi-objective functions are used for testing. The experimental results show that the improved NDE-NSGA-II algorithm has better distribution
stability and higher search solution.
关键词
Keywords
references
ZOU DE-XUAN, LIU HAI-KUAN, GAO LI-QUN, et al. An Improved Differential Evolution Algorithm for the Task Assignment Problem[J]. Engineering Applications of Artificial Intelligence, 2011, 24(4):616-624. DOI: 616
REZA SALIMI, HOMAYUN MOSTAMENI, HESAM OMRANPOUR. Task scheduling with load balancing for computational grid NSGA-Ⅱ with fuzzy mutation[C]//2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing, Solan, 2012: 79-84.
QINGFU ZHANG, HUI LI. Moea/d: A multiobjective evolutionary algorithm based on decomposition[J]. IEEE Transactions on evolutionary computation, 2007, 11(6):712-731. DOI: 712
HONDA S, IGARASHI T, NARITA Y. Multi-objective Optimization of Curvilinear Fiber Shapes for Laminated Composite Plates by Using NSGA-Ⅱ[J]. Composites Part B: Engineering, 2013, 45(1):1071-1078. DOI: 1071
SRINIVAS N, DEB K. Multi-objective optimization using non-dominated sorting in genetic algorithms[J]. Evolutionary Computation, 1994, 2(3):221-248. DOI: 221
DEB K, PRATAP A, AGRAWAL S, et al. A fast and elistic multi-objective genetic algorithm: NSGA-Ⅱ[J]. IEEE Trans Evol Comput, 2002, 6(2):182-197. DOI: 182