Asynchronous Evolutionary Multi-Objective Algorithms with heterogeneous evaluation costs

International audienceMaster-slave parallelization of Evolutionary Algorithms (EAs) is straightforward, by distributing all fitness computations to slaves. The benefits of asynchronous steady state approaches are well-known when facing a possible heterogeneity among the evaluation costs in term of runtime, be they due to heterogeneous hardware or non-linear numerical simulations. However, when this heterogeneity depends on some characteristics of the individuals being evaluated, the search might be biased, and some regions of the search space poorly explored. Motivated by a real-world case study of multi-objective optimization problem the optimization of the combustion in a Diesel Engine the consequences of different components of heterogeneity in the evaluation costs on the convergence of two Evolutionary Multi-objective Optimization Algorithms are investigated on artificially-heterogeneous benchmark problems. In some cases, better spread of the population on the Pareto front seem to result from the interplay between the heterogeneity at hand and the evolutionary search