Soft Computing

, Volume 21, Issue 18, pp 5399–5412 | Cite as

Universal partially evolved parallelization of MOEA/D for multi-objective optimization on message-passing clusters

  • Weiqin Ying
  • Yuehong Xie
  • Yu Wu
  • Bingshen Wu
  • Shiyun Chen
  • Weipeng He
Methodologies and Application


This paper presents a universal partially evolved parallelization of the multi-objective evolutionary algorithm based on decomposition (MOEA/D) for multi-objective optimization on message-passing clusters to reduce its computation time. The partially evolved MOEA/D (peMOEA/D) is suitable not only for the bi-objective space, but also for higher dimensional objective spaces by using a partially evolved island model. This model improves the algorithm universality and population diversity by keeping a subpopulation equal in size to the entire population, but only evolving a partial (equal to a partition size) subpopulation on each separate processor in a cluster. Furthermore, a nearest-neighbor partitioning approach, hybrid migration policy and adaptive neighbor-based topology are adopted in the peMOEA/D. The fat partitions generated by the nearest-neighbor partitioning can reduce migration traffic of elitist individuals across subpopulations. Then, hybrid migration of both elitist individuals and utopian points helps separate subpopulations to cooperate in guiding the search quickly towards a complete front. Next, the adaptive neighbor-based topology connects neighbor partitions only and achieves an excellent balance between convergence speed and migration traffic. Experimental results on benchmark multi-objective optimization problems with two or more objectives demonstrate the satisfactory overall performance of the peMOEA/D in terms of both convergence performance and speedup on message-passing clusters.


Evolutionary algorithm Multi-objective optimization  Parallelization Decomposition  Message-passing clusters 



This work was supported in part by the Natural Science Foundation of Guangdong Province, China (No. 2015A030313204), the Pearl River Science & Technology Nova Program of Guangzhou (No. 2014J2200052), the National Natural Science Foundation of China (Nos. 61203310 and 61503087), the China Scholarship Council (CSC) (Nos. 201406155076 and 201408440193) and the Fundamental Research Funds for the Central Universities, SCUT (No. 2013ZZ0048).

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.


  1. Branke J, Schmeck H, Deb K, Reddy S (2004) Parallelizing multi-objective evolutionary algorithms: cone separation. In: Proceedings of the Congress on Evolutionary Computation (CEC-2004), vol 2. IEEE Press, pp 1952–1957Google Scholar
  2. Cheshmehgaz HR, Desa MI, Wibowo A (2013) Effective local evolutionary searches distributed on an island model solving bi-objective optimization problems. Appl Intell 38(3):331–356CrossRefGoogle Scholar
  3. Clarke L, Glendinning I, Hempel R (1994) The MPI message passing interface standard. In: Programming environments for massively parallel distributed systems. Birkh\(\ddot{a}\)user, Basel, pp 213–218Google Scholar
  4. Coello C, Christiansen AD (2000) Multiobjective optimization of trusses using genetic algorithms. Comput Struct 75(6):647–660CrossRefGoogle Scholar
  5. Cutello V, Narzisi G, Nicosia G (2006) A multi-objective evolutionary approach to the protein structure prediction problem. J R Soc Interface 3(6):139–151CrossRefGoogle Scholar
  6. Deb K, Pratap A, Agarwal S, Meyarivan T (2002a) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197CrossRefGoogle Scholar
  7. Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: Solving problems with box constraints. IEEE Trans Evol Comput 18(4):577–601CrossRefGoogle Scholar
  8. Deb K, Thiele L, Laumanns M, Zitzler E (2002b) Scalable multi-objective optimization test problems. In: Proceedings of Congress on Evolutionary Computation. IEEE Press, pp 825–830Google Scholar
  9. Deb K, Zope P, Jain A (2003) Distributed computing of pareto-optimal solutions with evolutionary algorithms. In: Evolutionary multi-criterion optimization. Springer, Berlin, pp 534–549Google Scholar
  10. Durillo JJ, Zhang Q, Nebro AJ, Alba E (2011) Distribution of computational effort in parallel MOEA/D. In: Learning and intelligent optimization. Springer, Berlin, pp 488–502Google Scholar
  11. Li H, Zhang Q (2009) Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II. IEEE Trans Evol Comput 13(2):284–302CrossRefGoogle Scholar
  12. Molina G, Alba E, Talbi EG (2008) Optimal sensor network layout using multi-objective metaheuristics. J Univ Comput Sci 14(15):2549–2565Google Scholar
  13. Nebro AJ, Durillo JJ (2010) A study of the parallelization of the multi-objective metaheuristic MOEA/D. In: Learning and intelligent optimization. Springer, Berlin, pp 303–317Google Scholar
  14. Streichert F, Ulmer H, Zell A (2005) Parallelization of multi-objective evolutionary algorithms using clustering algorithms. In: Evolutionary multi-criterion optimization. Springer, Berlin, pp 92–107Google Scholar
  15. van Veldhuizen DA, Zydallis JB, Lamont GB (2003) Considerations in engineering parallel multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):144–173CrossRefGoogle Scholar
  16. Ying W, Xie Y, Xu X, Wu Y, Xu A, Wang Z (2015) An efficient and universal conical hypervolume evolutionary algorithm in three or higher dimensional objective space. IEICE Trans Fundam Electron Commun Comput Sci E98-A(11):2330–2335Google Scholar
  17. Ying W, Xu X (2012) Bi-objective optimal design of truss structure using normalized conical-area evolutionary algorithm. Int J Adv Comput Technol 4(15):162–171Google Scholar
  18. Ying W, Xu X, Feng Y, Wu Y (2012) An efficient conical area evolutionary algorithm for bi-objective optimization. IEICE Trans Fundam Electron Commun Comput Sci E95-A(8):1420–1425Google Scholar
  19. Zaharie D, Petcu D, Panica S (2008) A hierarchical approach in distributed evolutionary algorithms for multiobjective optimization. In: Large-scale scientific computing. Springer, Berlin, pp 516–523Google Scholar
  20. Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731Google Scholar
  21. Zhou A, Qu BY, Li H, Zhao SZ, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1(1):32–49Google Scholar
  22. Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173–195CrossRefGoogle Scholar
  23. Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Evolutionary methods for design optimization and control with applications to industrial problems. International Center for Numerical Methods in Engineering, pp 95–100Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Weiqin Ying
    • 1
  • Yuehong Xie
    • 1
  • Yu Wu
    • 2
  • Bingshen Wu
    • 1
  • Shiyun Chen
    • 1
  • Weipeng He
    • 1
  1. 1.School of Software EngineeringSouth China University of TechnologyGuangzhouChina
  2. 2.School of Computer Science and Educational SoftwareGuangzhou UniversityGuangzhouChina

Personalised recommendations