Skip to main content

2017 | OriginalPaper | Buchkapitel

Enhanced Pareto Interpolation Method to Aid Decision Making for Discontinuous Pareto Optimal Fronts

verfasst von : Kalyan Shankar Bhattacharjee, Hemant Kumar Singh, Tapabrata Ray

Erschienen in: AI 2017: Advances in Artificial Intelligence

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

Multi-criteria decision making is of interest in several domains such as engineering, finance and logistics. It aims to address the key challenges of search for optimal solutions and decision making in the presence of multiple conflicting design objectives/criteria. The decision making aspect can be particularly challenging when there are too few Pareto optimal solutions available as this severely limits the understanding of the nature of the Pareto optimal front (POF) and subsequently affects the confidence on the choice of solutions. This problem is studied in this paper, wherein a decision maker is presented with a few outcomes and the aim is to identify regions of interest for further investigation. To address the problem, the contemporary approaches attempt to generate POF approximation through linear interpolation of a given set of (a few) Pareto optimal outcomes. While the process helps in gaining an understanding of the POF, it ignores the possibility of discontinuities or voids in the POF. In this study, we investigate two measures to alleviate this difficulty. First is to make use of infeasible solutions obtained during the search, along with the Pareto outcomes while constructing the interpolations. Second is to use proximity to a set of uniform reference directions to determine potential discontinuities. Consequently, the proposed approach enables approximation of both continuous and discontinuous POF more accurately. Additionally, a set of interpolated outcomes along uniformly distributed reference directions are presented to the decision maker. The errors in the given interpolations are also estimated in order to further aid decision making by establishing confidence on predictions. We illustrate the performance of the approach using four problems spanning different types of fronts, such as mixed (convex/concave), degenerate, and disconnected.

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
Note that in previous works, polytopes has also been used to refer to simplex directly, since only convex polytopes are involved in the process.
 
2
In [10], the first two rules R1.1 and R1.2 are covered as a single rule R1.
 
Literatur
1.
Zurück zum Zitat Asafuddoula, M., Ray, T., Sarker, R.: A decomposition-based evolutionary algorithm for many objective optimization. IEEE Trans. Evol. Comput. 19(3), 445–460 (2015)CrossRef Asafuddoula, M., Ray, T., Sarker, R.: A decomposition-based evolutionary algorithm for many objective optimization. IEEE Trans. Evol. Comput. 19(3), 445–460 (2015)CrossRef
3.
Zurück zum Zitat Bhattacharjee, K.S., Singh, H.K., Ray, T.: An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making. J. Global Optim. 68, 1–23 (2016)MathSciNetMATH Bhattacharjee, K.S., Singh, H.K., Ray, T.: An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making. J. Global Optim. 68, 1–23 (2016)MathSciNetMATH
4.
Zurück zum Zitat Bhattacharjee, K.S., Singh, H.K., Ray, T.: A study on performance metrics to identify solutions of interest from a trade-off set. In: Ray, T., Sarker, R., Li, X. (eds.) ACALCI 2016. LNCS, vol. 9592, pp. 66–77. Springer, Cham (2016). doi:10.1007/978-3-319-28270-1_6 CrossRef Bhattacharjee, K.S., Singh, H.K., Ray, T.: A study on performance metrics to identify solutions of interest from a trade-off set. In: Ray, T., Sarker, R., Li, X. (eds.) ACALCI 2016. LNCS, vol. 9592, pp. 66–77. Springer, Cham (2016). doi:10.​1007/​978-3-319-28270-1_​6 CrossRef
5.
Zurück zum Zitat Das, I., Dennis, J.E.: Normal-bounday intersection: a new method for generating pareto optimal points in multicriteria optimization problems. SIAM J. Optim. 8(3), 631–657 (1998)MathSciNetCrossRefMATH Das, I., Dennis, J.E.: Normal-bounday intersection: a new method for generating pareto optimal points in multicriteria optimization problems. SIAM J. Optim. 8(3), 631–657 (1998)MathSciNetCrossRefMATH
6.
Zurück zum Zitat Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms, vol. 16. Wiley, Hoboken (2001)MATH Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms, vol. 16. Wiley, Hoboken (2001)MATH
7.
Zurück zum Zitat Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 825–830. IEEE, Honolulu (2002) Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 825–830. IEEE, Honolulu (2002)
8.
Zurück zum Zitat Hartikainen, M., Lovison, A.: PAINT-SiCon: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization. J. Global Optim. 62(2), 243–261 (2014)MathSciNetCrossRefMATH Hartikainen, M., Lovison, A.: PAINT-SiCon: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization. J. Global Optim. 62(2), 243–261 (2014)MathSciNetCrossRefMATH
9.
Zurück zum Zitat Hartikainen, M., Miettinen, K., Wiecek, M.M.: Constructing a Pareto front approximation for decision making. Math. Methods Oper. Res. 73(2), 209–234 (2011)MathSciNetCrossRefMATH Hartikainen, M., Miettinen, K., Wiecek, M.M.: Constructing a Pareto front approximation for decision making. Math. Methods Oper. Res. 73(2), 209–234 (2011)MathSciNetCrossRefMATH
10.
Zurück zum Zitat Hartikainen, M., Miettinen, K., Wiecek, M.M.: PAINT: Pareto front interpolation for nonlinear multiobjective optimization. Comput. Optim. Appl. 52(3), 845–867 (2012)MathSciNetCrossRefMATH Hartikainen, M., Miettinen, K., Wiecek, M.M.: PAINT: Pareto front interpolation for nonlinear multiobjective optimization. Comput. Optim. Appl. 52(3), 845–867 (2012)MathSciNetCrossRefMATH
11.
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
12.
Zurück zum Zitat Ruzika, S., Wiecek, M.M.: Approximation methods in multiobjective programming. J. Optim. Theory Appl. 126(3), 473–501 (2005)MathSciNetCrossRefMATH Ruzika, S., Wiecek, M.M.: Approximation methods in multiobjective programming. J. Optim. Theory Appl. 126(3), 473–501 (2005)MathSciNetCrossRefMATH
13.
Zurück zum Zitat Singh, H.K., Alam, K., Ray, T.: Use of infeasible solutions during constrained evolutionary search: a short survey. In: Ray, T., Sarker, R., Li, X. (eds.) ACALCI 2016. LNCS, vol. 9592, pp. 193–205. Springer, Cham (2016). doi:10.1007/978-3-319-28270-1_17 CrossRef Singh, H.K., Alam, K., Ray, T.: Use of infeasible solutions during constrained evolutionary search: a short survey. In: Ray, T., Sarker, R., Li, X. (eds.) ACALCI 2016. LNCS, vol. 9592, pp. 193–205. Springer, Cham (2016). doi:10.​1007/​978-3-319-28270-1_​17 CrossRef
14.
Zurück zum Zitat Singh, H.K., Bhattacharjee, K.S., Ray, T.: A projection-based approach for constructing piecewise linear pareto front approximations. J. Mech. Des. 138(9), 091404 (2016)CrossRef Singh, H.K., Bhattacharjee, K.S., Ray, T.: A projection-based approach for constructing piecewise linear pareto front approximations. J. Mech. Des. 138(9), 091404 (2016)CrossRef
15.
Zurück zum Zitat Van Veldhuizen, D.A.: Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Ph.D. thesis, Air Force Institute of Technology (1999) Van Veldhuizen, D.A.: Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Ph.D. thesis, Air Force Institute of Technology (1999)
Metadaten
Titel
Enhanced Pareto Interpolation Method to Aid Decision Making for Discontinuous Pareto Optimal Fronts
verfasst von
Kalyan Shankar Bhattacharjee
Hemant Kumar Singh
Tapabrata Ray
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-63004-5_8

Premium Partner