Skip to main content

2017 | OriginalPaper | Buchkapitel

Empirical Investigations of Reference Point Based Methods When Facing a Massively Large Number of Objectives: First Results

verfasst von : Ke Li, Kalyanmoy Deb, Tolga Altinoz, Xin Yao

Erschienen in: Evolutionary Multi-Criterion Optimization

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Multi-objective optimization with more than three objectives has become one of the most active topics in evolutionary multi-objective optimization (EMO). However, most existing studies limit their experiments up to 15 or 20 objectives, although they claimed to be capable of handling as many objectives as possible. To broaden the insights in the behavior of EMO methods when facing a massively large number of objectives, this paper presents some preliminary empirical investigations on several established scalable benchmark problems with 25, 50, 75 and 100 objectives. In particular, this paper focuses on the behavior of the currently pervasive reference point based EMO methods, although other methods can also be used. The experimental results demonstrate that the reference point based EMO method can be viable for problems with a massively large number of objectives, given an appropriate choice of the distance measure. In addition, sufficient population diversity should be given on each weight vector or a local niche, in order to provide enough selection pressure. To the best of our knowledge, this is the first time an EMO methodology has been considered to solve a massively large number of conflicting objectives.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
Also known as decomposition-based method, but here we use the terminology reference point based method without loss of generality.
 
2
Due to the page limit, the parallel coordinate plots are put in the supplementary file, which can be found in https://​coda-group.​github.​io/​publications/​suppEMO.​pdf.
 
Literatur
1.
Zurück zum Zitat Adra, S.F., Fleming, P.J.: Diversity management in evolutionary many-objective optimization. IEEE Trans. Evol. Comput. 15(2), 183–195 (2011)CrossRef Adra, S.F., Fleming, P.J.: Diversity management in evolutionary many-objective optimization. IEEE Trans. Evol. Comput. 15(2), 183–195 (2011)CrossRef
2.
Zurück zum Zitat Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Hypervolume-based multiobjective optimization: theoretical foundations and practical implications. Theor. Comput. Sci. 425, 75–103 (2012)MathSciNetCrossRefMATH Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Hypervolume-based multiobjective optimization: theoretical foundations and practical implications. Theor. Comput. Sci. 425, 75–103 (2012)MathSciNetCrossRefMATH
3.
Zurück zum Zitat Bader, J., Zitzler, E.: HypE: an algorithm for fast hypervolume-based many-objective optimization. Evol. Comput. 19(1), 45–76 (2011)CrossRef Bader, J., Zitzler, E.: HypE: an algorithm for fast hypervolume-based many-objective optimization. Evol. Comput. 19(1), 45–76 (2011)CrossRef
4.
Zurück zum Zitat Beume, N., Naujoks, B., Emmerich, M.T.M.: SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653–1669 (2007)CrossRefMATH Beume, N., Naujoks, B., Emmerich, M.T.M.: SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653–1669 (2007)CrossRefMATH
5.
Zurück zum Zitat Coello, C.A.C., Cortés, N.C.: Solving multiobjective optimization problems using an artificial immune system. Genet. Program. Evolvable Mach. 6(2), 163–190 (2005)CrossRef Coello, C.A.C., Cortés, N.C.: Solving multiobjective optimization problems using an artificial immune system. Genet. Program. Evolvable Mach. 6(2), 163–190 (2005)CrossRef
6.
Zurück zum Zitat Das, I., Dennis, J.E.: Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8, 631–657 (1998)MathSciNetCrossRefMATH Das, I., Dennis, J.E.: Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8, 631–657 (1998)MathSciNetCrossRefMATH
7.
Zurück zum Zitat Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)CrossRef Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)CrossRef
8.
Zurück zum Zitat Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. John Wiley & Sons Inc., New York (2001)MATH Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. John Wiley & Sons Inc., New York (2001)MATH
9.
Zurück zum Zitat Deb, K., Jain, H.: 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–601 (2014)CrossRef Deb, K., Jain, H.: 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–601 (2014)CrossRef
10.
Zurück zum Zitat Deb, K., Sundar, J., Bhaskara, U., Chaudhuri, S.: Reference point based multiobjective optimization using evolutionary algorithms. Int. J. Comput. Intell. Res. 2(3), 273–286 (2006)MathSciNetCrossRef Deb, K., Sundar, J., Bhaskara, U., Chaudhuri, S.: Reference point based multiobjective optimization using evolutionary algorithms. Int. J. Comput. Intell. Res. 2(3), 273–286 (2006)MathSciNetCrossRef
11.
Zurück zum Zitat Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evol. Multiobjective Optim. Advanced Information and Knowledge Processing, pp. 105–145. Springer, London (2005)CrossRef Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evol. Multiobjective Optim. Advanced Information and Knowledge Processing, pp. 105–145. Springer, London (2005)CrossRef
12.
Zurück zum Zitat Ishibuchi, H., Setoguchi, Y., Masuda, H., Nojima, Y.: Performance of decomposition-based many-objective algorithms strongly depends on Pareto front shapes. IEEE Trans. Evol. Comput. PP(99), 1 (2016)CrossRef Ishibuchi, H., Setoguchi, Y., Masuda, H., Nojima, Y.: Performance of decomposition-based many-objective algorithms strongly depends on Pareto front shapes. IEEE Trans. Evol. Comput. PP(99), 1 (2016)CrossRef
13.
Zurück zum Zitat Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. 48(1), 13 (2015)CrossRef Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. 48(1), 13 (2015)CrossRef
14.
Zurück zum Zitat Li, K., Deb, K., Zhang, Q., Kwong, S.: An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans. Evol. Comput. 19(5), 694–716 (2015)CrossRef Li, K., Deb, K., Zhang, Q., Kwong, S.: An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans. Evol. Comput. 19(5), 694–716 (2015)CrossRef
15.
Zurück zum Zitat Li, K., Kwong, S., Cao, J., Li, M., Zheng, J., Shen, R.: Achieving balance between proximity and diversity in multi-objective evolutionary algorithm. Inf. Sci. 182(1), 220–242 (2012)MathSciNetCrossRef Li, K., Kwong, S., Cao, J., Li, M., Zheng, J., Shen, R.: Achieving balance between proximity and diversity in multi-objective evolutionary algorithm. Inf. Sci. 182(1), 220–242 (2012)MathSciNetCrossRef
16.
Zurück zum Zitat Li, K., Kwong, S., Zhang, Q., Deb, K.: Interrelationship-based selection for decomposition multiobjective optimization. IEEE Trans. Cybern. 45(10), 2076–2088 (2015)CrossRef Li, K., Kwong, S., Zhang, Q., Deb, K.: Interrelationship-based selection for decomposition multiobjective optimization. IEEE Trans. Cybern. 45(10), 2076–2088 (2015)CrossRef
17.
Zurück zum Zitat Li, K., Zhang, Q., Kwong, S., Li, M., Wang, R.: Stable matching based selection in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 18(6), 909–923 (2014)CrossRef Li, K., Zhang, Q., Kwong, S., Li, M., Wang, R.: Stable matching based selection in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 18(6), 909–923 (2014)CrossRef
18.
Zurück zum Zitat Miettinen, K.: Nonlinear Multiobjective Optimization, vol. 12. Kluwer Academic Publishers, Boston (1999)MATH Miettinen, K.: Nonlinear Multiobjective Optimization, vol. 12. Kluwer Academic Publishers, Boston (1999)MATH
19.
Zurück zum Zitat Purshouse, R.C., Fleming, P.J.: On the evolutionary optimization of many conflicting objectives. IEEE Trans. Evol. Comput. 11(6), 770–784 (2007)CrossRef Purshouse, R.C., Fleming, P.J.: On the evolutionary optimization of many conflicting objectives. IEEE Trans. Evol. Comput. 11(6), 770–784 (2007)CrossRef
20.
Zurück zum Zitat Sato, H., Aguirre, H.E., Tanaka, K.: Self-controlling dominance area of solutions in evolutionary many-objective optimization. In: Deb, K., Bhattacharya, A., Chakraborti, N., Chakroborty, P., Das, S., Dutta, J., Gupta, S.K., Jain, A., Aggarwal, V., Branke, J., Louis, S.J., Tan, K.C. (eds.) SEAL 2010. LNCS, vol. 6457, pp. 455–465. Springer, Heidelberg (2010). doi:10.1007/978-3-642-17298-4_49 CrossRef Sato, H., Aguirre, H.E., Tanaka, K.: Self-controlling dominance area of solutions in evolutionary many-objective optimization. In: Deb, K., Bhattacharya, A., Chakraborti, N., Chakroborty, P., Das, S., Dutta, J., Gupta, S.K., Jain, A., Aggarwal, V., Branke, J., Louis, S.J., Tan, K.C. (eds.) SEAL 2010. LNCS, vol. 6457, pp. 455–465. Springer, Heidelberg (2010). doi:10.​1007/​978-3-642-17298-4_​49 CrossRef
21.
Zurück zum Zitat Wang, H., Jiao, L., Yao, X.: Two_arch2: An improved two-archive algorithm for many-objective optimization. IEEE Trans. Evolutionary Computation 19(4), 524–541 (2015)CrossRef Wang, H., Jiao, L., Yao, X.: Two_arch2: An improved two-archive algorithm for many-objective optimization. IEEE Trans. Evolutionary Computation 19(4), 524–541 (2015)CrossRef
22.
Zurück zum Zitat Zhang, Q., Li, H.: MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evolutionary Computation 11, 712–731 (2007)CrossRef Zhang, Q., Li, H.: MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evolutionary Computation 11, 712–731 (2007)CrossRef
Metadaten
Titel
Empirical Investigations of Reference Point Based Methods When Facing a Massively Large Number of Objectives: First Results
verfasst von
Ke Li
Kalyanmoy Deb
Tolga Altinoz
Xin Yao
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-54157-0_27