A new approach to distribute MOEA pareto front computation

Multi-Objective Evolutionary Algorithms (MOEAs) offer compelling solutions to many real world problems, including software engineering ones. However, their efficiency decreases with the growing size of the problems at hand, hindering their applicability in practice. In this paper we propose a novel master-worker approach to distribute the computation of the Pareto Front (PF) for MOEAs (dubbed MOEA-DPF) and empirically evaluate it on a real-world software project management problem. With respect to previous work, our proposal can be used with any MOEA to tackle multiobjective problems regardless of their formulation/representation. Our results show that MOEA-DPF runs significantly faster (up to 3.1x speed-up using two workers) than its sequential counterpart while maintaining (and even improving) the quality of the PF. We conclude that MOEA-DPF provides an effective and simple solution to speed-up the execution of MOEAs by distributing the PF computation, making them effective for real-world problems.