Efficient and Accurate Parallel Genetic Algorithms
Efficient and Accurate Parallel Genetic Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Evolutionary Algorithms for Solving Multi-Objective Problems
Evolutionary Algorithms for Solving Multi-Objective Problems
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
Covariance Matrix Adaptation for Multi-objective Optimization
Evolutionary Computation
Towards a quick computation of well-spread pareto-optimal solutions
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Distributed computing of Pareto-optimal solutions with evolutionary algorithms
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Constrained multi-objective optimization using steady state genetic algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Steady-state selection and efficient covariance matrix update in the multi-objective CMA-ES
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Not all parents are equal for MO-CMA-ES
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Parallel master-slave evolutionary algorithms easily lead to linear speedups in the case of a small number of nodes... and homogeneous computational costs of the evaluations. However, modern computer now routinely have several hundreds of nodes - and in many real-world applications in which fitness computation involves heavy numerical simulations, the computational costs of these simulations can greatly vary from one individual to the next. A simple answer to the latter problem is to use asynchronous steady-state reproduction schemes. But the resulting algorithms then differ from the original sequential version, with two consequences: First, the linear speedup does not hold any more; Second, the convergence might be hindered by the heterogeneity of the evaluation costs. The multi-objective optimization of a diesel engine is first presented, a real-world case study where evaluations are very heterogeneous in terms of CPU cost. Both the speedup of asynchronous parallel algorithms in case of large number of nodes, and their convergence toward the Pareto Front in case of heterogeneous computation times, are then experimentally analyzed on artificial test functions. An alternative selection scheme involving the computational cost of the fitness evaluation is then proposed, that counteracts the effects of heterogeneity on convergence toward the Pareto Front.