A simple evolutionary algorithm for multi-objective optimization (SEAMO)

A simple steady-state, Pareto-based evolutionary algorithm is presented that uses an elitist strategy for replacement and a simple uniform scheme for selection. Throughout the genetic search, progress depends entirely on the replacement policy, and no fitness calculations, rankings, subpopulations, niches or auxiliary populations are required. Preliminary results presented in this paper show improvements on previously published results for some multiple knapsack problems