Ramp Shape Optimum Design for Airplane Land-Based Ski-Jump Takeoff via NSGA II
ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 02
E-SCIENCE '06 Proceedings of the Second IEEE International Conference on e-Science and Grid Computing
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
Multi-objective genetic algorithms: Problem difficulties and construction of test problems
Evolutionary Computation
A new strategy for parameter estimation of dynamic differential equations based on NSGA II
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Multi-objective parameters selection for SVM classification using NSGA-II
ICDM'06 Proceedings of the 6th Industrial Conference on Data Mining conference on Advances in Data Mining: applications in Medicine, Web Mining, Marketing, Image and Signal Mining
Hi-index | 0.00 |
We try to improve the NSGA-II, one of the most classical MOP algorithms, in two ways. To measure individual crowding distance by edge weight of minimum spanning tree and k-nearest-neighbors Pareto rank assignment strategy is helpful on diversity of population; A compound crossover operator increases the extent and the ability of search. Experimental results on ZDTs and DTLZs, suggest that A K-Nearest-Neighbors Pareto Rank Assignment Strategy and Compound Crossover Operator Based NSGA-II (KC NSGA-II) works faster and has more diverse solutions than its origins.