Reference point based distributed computing for multiobjective optimization

As the computational complexity of the problem and/or the number of objectives increases, a large population has to be evaluated at each generation of algorithm, and this process needs more computational resources, or requires more time for the same computational resource. However, distributing the tasks into different processors (or cores) is a good solution in speeding up the process overall. In this study, a novel and pragmatic distributed computing approach for multiobjective evolutionary optimization algorithm is proposed. Instead of dividing the objective space into pre-defined cone-domination principles, as proposed in an earlier study, a distribution of reference points initialized on a hyper-plane spanning the entire objective space is assigned to different processors and the R-NSGA-II procedure is invoked to find respective partial efficient fronts. Our results show that the proposed distributed computing approach reduces the overall computational effort compared to that needed with a single-processor method.

[1]  Hartmut Schmeck,et al.  Parallel implementations of evolutionary algorithms , 2001 .

[2]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[3]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[4]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[5]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[6]  Kalyanmoy Deb,et al.  Distributed computing of Pareto-optimal solutions using multi-objective evolutionary algorithms , 2003 .

[7]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[8]  Yih-Long Chang,et al.  A scatter search approach to sequence-dependent setup times job shop scheduling , 2009 .

[9]  Andrew Lewis,et al.  Parallel multi-objective optimization using Master-Slave model on heterogeneous resources , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[10]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[11]  Kalyanmoy Deb,et al.  Distributed Computing of Pareto-Optimal Solutions with Evolutionary Algorithms , 2003, EMO.

[12]  Freerk A. Lootsma,et al.  State-of-the-art in parallel nonlinear optimization , 1988, Parallel Comput..

[13]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach , 2014, IEEE Transactions on Evolutionary Computation.

[14]  N. Melab,et al.  Parallel cooperative metaheuristics on the computational grid . A case study : the bi-objective Flow-Shop problem , 2015 .

[15]  El-Ghazali Talbi,et al.  Parallel cooperative meta-heuristics on the computational grid.: A case study: the bi-objective Flow-Shop problem , 2006, Parallel Comput..

[16]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[17]  Kalyanmoy Deb,et al.  Parallelizing multi-objective evolutionary algorithms: cone separation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[18]  Kalyanmoy Deb,et al.  Reference point based multi-objective optimization using evolutionary algorithms , 2006, GECCO.