Skip to main content
SpringerLink
Log in

MOEA/D with uniform decomposition measurement for many-objective problems

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Many-objective problems (MAPs) have put forward a number of challenges to classical Pareto-dominance based multi-objective evolutionary algorithms (MOEAs) for the past few years. Recently, researchers have suggested that MOEA/D (multi-objective evolutionary algorithm based on decomposition) can work for MAPs. However, there exist two difficulties in applying MOEA/D to solve MAPs directly. One is that the number of constructed weight vectors is not arbitrary and the weight vectors are mainly distributed on the boundary of weight space for MAPs. The other is that the relationship between the optimal solution of subproblem and its weight vector is nonlinear for the Tchebycheff decomposition approach used by MOEA/D. To deal with these two difficulties, we propose an improved MOEA/D with uniform decomposition measurement and the modified Tchebycheff decomposition approach (MOEA/D-UDM) in this paper. Firstly, a novel weight vectors initialization method based on the uniform decomposition measurement is introduced to obtain uniform weight vectors in any amount, which is one of great merits to use our proposed algorithm. The modified Tchebycheff decomposition approach, instead of the Tchebycheff decomposition approach, is used in MOEA/D-UDM to alleviate the inconsistency between the weight vector of subproblem and the direction of its optimal solution in the Tchebycheff decomposition approach. The proposed MOEA/D-UDM is compared with two state-of-the-art MOEAs, namely MOEA/D and UMOEA/D on a number of MAPs. Experimental results suggest that the proposed MOEA/D-UDM outperforms or performs similarly to the other compared algorithms in terms of hypervolume and inverted generational distance metrics on different types of problems. The effects of uniform weight vector initializing method and the modified Tchebycheff decomposition are also studied separately.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  • Borkowski J, Piepel G (2009) Uniform designs for highly constrained mixture experiments. J Quality Technol 41(1):35–47

    Google Scholar 

  • Cheng J, Zhang G, Li Z, Li Y (2011) Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems. Soft Comput 16:597–614

    Article  Google Scholar 

  • Coello Coello C, Lamont G, Van Veldhuizen D (2007) Evolutionary algorithms for solving multi-objective problems. Springer, London

  • Cornell J (1975) Some comments on designs for cox’s mixture polynomial. Technometrics 17:25–35

    Article  MATH  MathSciNet  Google Scholar 

  • Cornell J (1990) Experiments with mixtures, designs, models, and the analysis of mixture data. Wiley, New York

    MATH  Google Scholar 

  • Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, London

  • Deb K, Beyer H (2001) Self-adaptive genetic algorithms with simulated binary crossover. Evol Comput 9(2):197–221

    Article  Google Scholar 

  • Deb K, Jain H (2012a), An improved nsga-ii procedure for many-objective optimization, part i: solving problems with box constraints. Tech. Rep. 2012009, KanGAL

  • Deb K, Jain H (2012b) An improved nsga-ii procedure for many-objective optimization, part ii: handling constraints and extending to an adaptive approach. Tech Rep 2012010, KanGAL

  • Deb K, Agrawal S, Pratap A, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  • Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multi-objective optimization. Evol Multiobjective Optim :105–145

  • Fang K, Lin D (2003) Uniform designs and their application in industry. Handb Stat 22:131–170

    Article  MathSciNet  Google Scholar 

  • Fang K, Wang Y (1994) Number-theoretic methods in statistics. Chapman and Hall, London

  • Fang K, Yang Z (2000) On uniform design of experiments with restricted mixture and generation of uniform distribution on some domains. Statist Probab Lett 46:113–120

    Article  MATH  MathSciNet  Google Scholar 

  • Fleming P, Purshouse R, Lygoe R (2005) Many-objective optimization: an engineering design perspective. Evol Multi-Criterion Optim :14–32

  • Fonseca C, Fleming P (1998) Multiobjective optimization and multiple constraint handling with evolutionary algorithms-part ii: a application example. IEEE Trans Syst Man Cybernet Part A: Syst Hum 28(1):38–47

    Article  Google Scholar 

  • Gu F, Liu H (2010) A novel weight design in multi-objective evolutionary algorithm. CIS 2010:137–141

    Google Scholar 

  • Hickernell F (1998) Lattice rules: how well do they measure up? In: Random and quasi-random point sets. Springer, London, pp 106–166

  • Huband S, Hingston P, Barone L, While L (2006) A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans Evol Comput 10(5):477–506

    Article  Google Scholar 

  • Hughes E (2005) Evolutionary many-objective optimisation: many once or one many. In: CEC2005, pp 222–227

  • Hughes E (2007) Radar waveform optimisation as a many-objective application benchmark. EMO 4403:700–714

    Google Scholar 

  • Ishibuchi H, Nojima Y (2010) Performance evaluation of evolutionary multiobjective optimization algorithms for multiobjective fuzzy genetics-based machine learning. Soft Comput 15:2415– 2434

    Google Scholar 

  • Ishibuchi H, Tsukamoto N, Nojima Y (2008) Evolutionary many-objective optimization: a short review. CEC 2008:2424–2431

    Google Scholar 

  • Ishibuchi H, Akedo N, Nojima Y (2011a) A many-objective test problem for visually examining diversity maintenance behavior in a decision space. GECCO 2011:649–656

  • Ishibuchi H, Hitotsuyanagi Y, Ohyanagi H, Nojima Y (2011b) Effects of the existence of highly correlated objectives on the behavior of moea/d. EMO 6576:166–181

    Google Scholar 

  • Jiang S, Cai Z, Zhang J, Ong Y (2011) Multiobjective optimization by decomposition with pareto-adaptive weight vectors. In: ICNC 2011

  • Ke L, Zhang Q, Battiti R (2010) Multiobjective combinatorial optimization by using decomposition and ant colony. University of Essex, Tech Rep

  • Khare V, Yao X, Deb K (2003) Performance scaling of multi-objective evolutionary algorithms. EMO 2003:376–390

    Google Scholar 

  • Knowles J, Corne D (2007) Quantifying the effects of objective space dimension in evolutionary multiobjective optimization. EMO 2007:757–771

    Google Scholar 

  • Li H, Landa-Silva D (2011) An adaptive evolutionary multi-objective approach based on simulated annealing. Evol Comput 19(4):561–595

    Article  Google Scholar 

  • Li H, Zhang Q (2009) Multiobjective optimization problems with complicated pareto sets, moea/d and nsga-ii. IEEE Trans Evol Comput 13(2):284–302

    Article  Google Scholar 

  • Liu H, Wang Y, Cheung Y (2009) A multiobjective evolutionary algorithm using min-max strategy and sphere coordinate transformation. Intell Autom Soft Comput 15:361–384

    Article  Google Scholar 

  • Martinez Z, Coello C (2011) A multi-objective particle swarm optimizer based on decomposition. In: Genetic and Evolutionary Computation Conference

  • Mohammadi A, Omidvar M, Li X (2012) Reference point based multi-objective optimization through decomposition. In: IEEE world congress on computational intelligence, pp 10–15

  • Moubayed N, Petrovski A, McCall J (2010) A novel multi-objective particle swarm optimisation based on decomposition. In: International Conference on Parallel Problem Solving from Nature, pp 1–10

  • Ning J (2008) Uniform designs for mixture experiments. PhD thesis, Central China Normal University

  • Ning J, Zhou Y, Fang K (2011a) Discrepancy for uniform design of experiments with mixtures. J Stat Plan Inference 141:1487–1496

    Article  MATH  MathSciNet  Google Scholar 

  • Ning J, Zhou Y, Fang K (2011b) Uniform design for experiments with mixtures. Commun Stat Theory Methods 40(10):1734–1742

    Google Scholar 

  • Prescott P (2008) Nearly uniform designs for mixture experiments. Commun Statist Theory Methods 37:2095–2115

    Google Scholar 

  • Qi Y, Ma X, Liu F, Jiao L, Sun J, Wu J (2013) Moea/d with adaptive weight adjustment. Evol Comput (in press)

  • Saxena D, Duro J, Tiwari A, Deb K, Zhang Q (2013) Objective reduction in many-objective optimization: linear and nonlinear algorithms. IEEE Trans Evol Comput 17(1):77–99

    Article  Google Scholar 

  • Scheffe H (1958) Experiments with mixtures. J Royal Stat Soc Ser B 20:344–360

    Google Scholar 

  • Scheffe H (1963) Simplex-centroid designs for experiments with mixtures. J Royal Stat Soc Ser B 25:235–263

    MATH  MathSciNet  Google Scholar 

  • Shim V, Tan K, Tan K (2012) A hybrid estimation of distribution algorithm for solving the multi-objective multiple traveling salesman problem. In: WCCI 2012

  • Sindhya K, Ruuska S, Haanpaa T, Miettinen K (2011) A new hybrid mutation operator for multiobjective optimization with differential evolution. Soft Comput 15(10):2041–2055

    Article  Google Scholar 

  • Tan Y, Jiao Y, Li H, Wang X (2012) Moea/d + uniform design: a new version of moea/d for optimization problems with many objectives. Computer Oper Res

  • Zhang Q, Li H (2007) Moea/d: a multi-objective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731

    Article  Google Scholar 

  • Zitzler E, Laumanns M, Thiele L (2002) Spea 2: improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Evolutionary Methods for Design, Optimization, and Control, pp 19–26

  • Zitzler E, Thiele L, Laumanns M, Fonseca C, Fonseca V (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117–132

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by the Program for Cheung Kong Scholars and Innovative Research Team in University Nos. IRT1170 and IRT1170,the National Research Foundation for the China Postdoctoral Science Foundation Special funded project under Grant Nos. 201104658, 20090203120016, 20100203120008 and 200807010003, the Doctoral Program of Higher Education of China under Grant Nos. 200807010003, 20090203120016 and 20100203120008, the National Natural Science Foundation of China under Grant Nos. 61072106, 61072139, 61001202 and 61003199, the Fundamental Research Funds for the Central Universities under Grant Nos. JY10000903007, K5051203007 and K5051203002, the Fund for Foreign Scholars in University Research and Teaching Programs the 111 Project No. B07048, and the Provincial Natural Science Foundation of Shaanxi of China under Grant Nos. 2009JQ8015 and 2011JQ8010.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Xidian University, Xi’an,  710071, China

    Xiaoliang Ma, Yutao Qi & Fang Liu

  2. Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China, Xidian University, Xi’an,  710071, China

    Xiaoliang Ma, Yutao Qi, Lingling Li, Fang Liu, Licheng Jiao & Jianshe Wu

Authors
  1. Xiaoliang Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yutao Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lingling Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Licheng Jiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jianshe Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fang Liu.

Additional information

Communicated by Y. Jin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ma, X., Qi, Y., Li, L. et al. MOEA/D with uniform decomposition measurement for many-objective problems. Soft Comput 18, 2541–2564 (2014). https://doi.org/10.1007/s00500-014-1234-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-014-1234-8

Keywords

Search

Navigation