scholarly journals A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling

Author(s):  
Andrew M. Sutton ◽  
Frank Neumann
2010 ◽  
Vol 18 (3) ◽  
pp. 335-356 ◽  
Author(s):  
Oliver Giel ◽  
Per Kristian Lehre

Multi-objective evolutionary algorithms (MOEAs) have become increasingly popular as multi-objective problem solving techniques. An important open problem is to understand the role of populations in MOEAs. We present two simple bi-objective problems which emphasise when populations are needed. Rigorous runtime analysis points out an exponential runtime gap between the population-based algorithm simple evolutionary multi-objective optimiser (SEMO) and several single individual-based algorithms on this problem. This means that among the algorithms considered, only the population-based MOEA is successful and all other algorithms fail.


Sign in / Sign up

Export Citation Format

Share Document