Efficient and Scalable Pareto Optimization by Evolutionary Local Selection Algorithms

• Published in: Evolutionary computation Vol. 8; no. 2; pp. 223 - 247
• Main Authors: Menczer, Filippo, Degeratu, Melania, Street, W. Nick
• Format: Journal Article
• Language: English
• Published: One Rogers Street, Cambridge, MA 02142-1209, USA MIT Press 01.06.2000
• Subjects: agent-based search; Algorithms; Biological Evolution; Computer Simulation; cover; efficiency; ELSA; Evaluation Studies as Topic; Evolutionary algorithms; local selection; Models, Genetic; multicriterion optimization; Pareto front; scalability; Selection, Genetic
• ISSN: 1063-6560; 1530-9304
• DOI: 10.1162/106365600568185

Local selection is a simple selection scheme in evolutionary computation. Individual fitnesses are accumulated over time and compared to a fixed threshold, rather than to each other, to decide who gets to reproduce. Local selection, coupled with fitness functions stemming from the consumption of finite shared environmental resources, maintains diversity in a way similar to fitness sharing. However, it is more efficient than fitness sharing and lends itself to parallel implementations for distributed tasks. While local selection is not prone to premature convergence, it applies minimal selection pressure to the population. Local selection is, therefore, particularly suited to Pareto optimization or problem classes where diverse solutions must be covered. This paper introduces ELSA, an evolutionary algorithm employing local selection and outlines three experiments in which ELSA is applied to multiobjective problems: a multimodal graph search problem, and two Pareto optimization problems. In all these experiments, ELSA significantly outperforms other well-known evolutionary algorithms. The paper also discusses scalability, parameter dependence, and the potential distributed applications of the algorithm.