On asynchronous non-dominated sorting for steady-state multiobjective evolutionary algorithms
Ilya Yakupov, Maxim Buzdalov · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2018
In parallel and distributed environments, generational evolutionary algorithms often do not exploit the full potential of the computation system since they have to wait until the entire population is evaluated before starting selection procedures. Steady-state algorithms can perform fitness evaluations asynchronously however, if the algorithm updates its state in a complicated way - which is common in multiobjective evolutionary algorithms - the threads will eventually have to wait until this update finishes.