Abstract
Optimization algorithms typically deliver a set of trade-off solutions for problems involving multi/many-objectives in conflict.The number of such solutions could be in hundreds, thousands or even more. A decision maker typically identifies a handful of preferred trade-off solutions (solutions of interest (SOI)) from the above set based on secondary indicators e.g. expected marginal utility, convex bulge, hypervolume contribution, bend angle, reflex angle etc. In this paper, we first highlight that members of SOI could be significantly different depending on the choice of the secondary indicator. This leads to an important question “what metrics should a decision maker use to choose a solution over another ?” and more importantly “how to identify a handful of solutions ?” from a potentially large set of solutions. In this paper we introduce an approach based on local curvature to select such solutions of interest. The performance of the approach is illustrated using a bi-objective test problem, and two many-objective engineering optimization problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Asafuddoula, M., Ray, T., Sarker, R.: A decomposition-based evolutionary algorithm for many objective optimization. IEEE Trans. Evol. Comput. 19(3), 445–460 (2015)
Bechikh, S., Said, L.B., Ghédira, K.: Searching for knee regions of the pareto front using mobile reference points. Soft Comput. 15(9), 1807–1823 (2011)
Branke, J., Deb, K., Dierolf, H., Osswald, M.: Finding knees in multi-objective optimization. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 722–731. Springer, Heidelberg (2004)
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)
Das, I.: On characterizing the knee of the pareto curve based on normal-boundary intersection. Struct. Optim. 18(2–3), 107–115 (1999)
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)
Deb, K., Gupta, S.: Understanding knee points in bicriteria problems and their implications as preferred solution principles. Eng. Optim. 43(11), 1175–1204 (2011)
Rachmawati, L., Srinivasan, D.: Multiobjective evolutionary algorithm with controllable focus on the knees of the pareto front. IEEE Trans. Evol. Comput. 13(4), 810–824 (2009)
Ray, T., Tai, K., Seow, K.C.: An evolutionary algorithm for multiobjective optimization. Eng. Optim. 33(3), 399–424 (2001)
Schütze, O., Laumanns, M., Coello, C.A.C.: Approximating the knee of an MOP with stochastic search algorithms. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 795–804. Springer, Heidelberg (2008)
Simpson, T.W., Chen, W., Allen, J.K., Mistree, F.: Conceptual design of a family of products through the use of the robust concept exploration method. AIAA/USAF/NASA/ISSMO Symp. Multi. Anal. Optim. 2, 1535–1545 (1996)
Wang, R., Zhang, Q., Zhang, T.: Pareto adaptive scalarising functions for decomposition based algorithms. In: Gaspar-Cunha, A., Henggeler Antunes, C., Coello, C.C. (eds.) EMO 2015. LNCS, vol. 9018, pp. 248–262. Springer, Heidelberg (2015)
Zhang, X., Tian, Y., Jin, Y.: A knee point driven evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. PP(99), 1 (2014)
Zitzler, E., Laumanns, M., Bleuler, S.: A tutorial on evolutionary multiobjective optimization. In: Gandibleux, X., Sevaux, M., Sörensen, K., T’kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems, vol. 535, pp. 3–37. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Bhattacharjee, K.S., Singh, H.K., Ray, T. (2016). A Study on Performance Metrics to Identify Solutions of Interest from a Trade-Off Set. In: Ray, T., Sarker, R., Li, X. (eds) Artificial Life and Computational Intelligence. ACALCI 2016. Lecture Notes in Computer Science(), vol 9592. Springer, Cham. https://doi.org/10.1007/978-3-319-28270-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-28270-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28269-5
Online ISBN: 978-3-319-28270-1
eBook Packages: Computer ScienceComputer Science (R0)