The algorithm design manual
Finding tight single-change covering designs with v=20, k=5
Discrete Mathematics - Special issue on the 17th british combinatorial conference selected papers
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Combining convergence and diversity in evolutionary multiobjective optimization
Evolutionary Computation
Rotated test problems for assessing the performance of multi-objective optimization algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Information Sciences: an International Journal
Hi-index | 0.01 |
There exist a number of high-performance Multi-Objective Evolutionary Algorithms (MOEAs) for solving Multi-Objective Optimization (MOO) problems; two of the best are NSGA-II and epsilon-MOEA. However, they lack an archive population sorted into levels of non-domination, making them unsuitable for construction problems where some type of backtracking to earlier intermediate solutions is required. In this paper we introduce our Stored Non-Domination Level (SNDL) MOEA for solving such construction problems. SNDL-MOEA combines some of the best features of NSGA-II and epsilon-MOEA with the ability to store and recall intermediate solutions necessary for construction problems. We present results for applying SNDL-MOEA to the Tight Single Change Covering Design (TSCCD) construction problem, demonstrating its applicability. Furthermore, we show with a detailed performance comparison between SNDL-MOEA, NSGA-II, and epsilon-MOEA on two standard test series that SNDL-MOEA is capable of outperforming NSGA-II and is competitive with epsilon-MOEA.