{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T17:14:38Z","timestamp":1778346878187,"version":"3.51.4"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T00:00:00Z","timestamp":1678147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T00:00:00Z","timestamp":1678147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001773","name":"University of New South Wales","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001773","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Multi-objective optimization problems and their solution algorithms are of great importance as single-objective optimization problems are not usually a true representation of many real-world problems. In general, multi-objective optimization problems result in a large set of Pareto optimal solutions. Each solution in this set is optimal with some trade-offs. Therefore, it is difficult for the decision-maker to select a solution, especially in the absence of subjective or judgmental information. Moreover, an analysis of all the solutions is computationally expensive and, hence, not practical. Thus, researchers have proposed several techniques such as clustering and ranking of Pareto optimal solutions to reduce the number of solutions. The ranking methods are often used to obtain a single solution, which is not a good representation of the entire Pareto set. This paper deviates from the common approach and proposes a novel graph-theoretical clustering method. The quality of the clustering based on the Silhouette score is used to determine the number of clusters. The connectivity in the objective space is used to find representative solutions for clusters. One step forward, we identify \u2018extreme solutions\u2019. Hence, the reduced set contains both extreme solutions and representative solutions. We demonstrate the performance of the proposed method by using different 3D and 8D benchmark Pareto fronts as well as Pareto fronts from a case study in Royal Australian Navy. Results revealed that the reduced set obtained from the proposed method outperforms that from the<jats:italic>K<\/jats:italic>-means clustering, which is the most popular traditional clustering approach in Pareto pruning.<\/jats:p>","DOI":"10.1007\/s10898-023-01275-y","type":"journal-article","created":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T03:02:52Z","timestamp":1678158172000},"page":"467-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3873-8660","authenticated-orcid":false,"given":"Sanath","family":"Kahagalage","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasan H\u00fcseyin","family":"Turan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatemeh","family":"Jalalvand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sondoss","family":"El Sawah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,7]]},"reference":[{"key":"1275_CR1","doi-asserted-by":"crossref","unstructured":"Abido, M.A.: Multiobjective optimal VAR dispatch using strength pareto evolutionary algorithm. In: 2006 IEEE International Conference on Evolutionary Computation, pp. 730\u2013736. IEEE (2006)","DOI":"10.1109\/CEC.2006.1688384"},{"issue":"2","key":"1275_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/TEVC.2010.2058117","volume":"15","author":"SF Adra","year":"2010","unstructured":"Adra, S.F., Fleming, P.J.: Diversity management in evolutionary many-objective optimization. IEEE Trans. Evol. Comput. 15(2), 183\u2013195 (2010)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1275_CR3","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows (1988)","DOI":"10.21236\/ADA594171"},{"key":"1275_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.compchemeng.2014.12.012","volume":"74","author":"E Antipova","year":"2015","unstructured":"Antipova, E., Pozo, C., Guill\u00e9n-Gos\u00e1lbez, G., Boer, D., Cabeza, L.F., Jim\u00e9nez, L.: On the use of filters to facilitate the post-optimal analysis of the pareto solutions in multi-objective optimization. Comput. Chem. Eng. 74, 48\u201358 (2015)","journal-title":"Comput. Chem. Eng."},{"issue":"7","key":"1275_CR5","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1080\/0305215X.2016.1242913","volume":"49","author":"O Ayadi","year":"2017","unstructured":"Ayadi, O., Felfel, H., Masmoudi, F.: Analytic hierarchy process-based approach for selecting a pareto-optimal solution of a multi-objective, multi-site supply-chain planning problem. Eng. Optim. 49(7), 1264\u20131280 (2017)","journal-title":"Eng. Optim."},{"key":"1275_CR6","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Dwork, C., Kleinberg, J.: Wherefore art thou R3579X? anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the 16th International Conference on World Wide Web, pp. 181\u2013190. ACM (2007)","DOI":"10.1145\/1242572.1242598"},{"issue":"3","key":"1275_CR7","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume, N., Naujoks, B., Emmerich, M.: Sms-emoa: Multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653\u20131669 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"1275_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.procs.2012.09.040","volume":"12","author":"VM Carrillo","year":"2012","unstructured":"Carrillo, V.M., Taboada, H.: A post-pareto approach for multi-objective decision making using a non-uniform weight generator method. Procedia Comput. Sci. 12, 116\u2013121 (2012)","journal-title":"Procedia Comput. Sci."},{"issue":"4","key":"1275_CR9","first-page":"63","volume":"1","author":"P Chaudhari","year":"2010","unstructured":"Chaudhari, P., Dharaskar, R., Thakare, V.: Computing the most significant solution from pareto front obtained in multi-objective evolutionary. Int. J. Adv. Comput. Sci. Appl. 1(4), 63\u201368 (2010)","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"issue":"1","key":"1275_CR10","first-page":"51","volume":"2","author":"M Cheikh","year":"2010","unstructured":"Cheikh, M., Jarboui, B., Loukil, T., Siarry, P.: A method for selecting pareto optimal solutions in multiobjective optimization. J. Inf. Math. Sci. 2(1), 51\u201362 (2010)","journal-title":"J. Inf. Math. Sci."},{"issue":"4","key":"1275_CR11","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2013","unstructured":"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\u2013601 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1275_CR12","doi-asserted-by":"crossref","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Evolutionary Multiobjective Optimization, pp. 105\u2013145. Springer (2005)","DOI":"10.1007\/1-84628-137-7_6"},{"key":"1275_CR13","doi-asserted-by":"crossref","unstructured":"Elsawah, S., Ryan, M.J., Gordon, L., Harris, R.: Model-based assessment of the submarine support system. In: INCOSE International Symposium, vol.\u00a028, pp. 392\u2013406. Wiley Online Library (2018)","DOI":"10.1002\/j.2334-5837.2018.00489.x"},{"issue":"4","key":"1275_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1080\/15427951.2004.10129093","volume":"1","author":"GW Flake","year":"2004","unstructured":"Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Internet Math. 1(4), 385\u2013408 (2004)","journal-title":"Internet Math."},{"issue":"9","key":"1275_CR15","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/S0305-0548(97)00102-0","volume":"25","author":"L Friedman","year":"1998","unstructured":"Friedman, L., Sinuany-Stern, Z.: Combining ranking scales and selecting variables in the DEA context: the case of industrial branches. Comput. Oper. Res. 25(9), 781\u2013791 (1998)","journal-title":"Comput. Oper. Res."},{"key":"1275_CR16","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2018.07.018","volume":"160","author":"D de la Fuente","year":"2018","unstructured":"de la Fuente, D., Vega-Rodr\u00edguez, M.A., P\u00e9rez, C.J.: Automatic selection of a single solution from the pareto front to identify key players in social networks. Knowl.-Based Syst. 160, 228\u2013236 (2018)","journal-title":"Knowl.-Based Syst."},{"issue":"4","key":"1275_CR17","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. Soc. Ind. Appl. Math. 9(4), 551\u2013570 (1961)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"1275_CR18","doi-asserted-by":"crossref","unstructured":"G\u00f6rke, R., Hartmann, T., Wagner, D.: Dynamic graph clustering using minimum-cut trees. In: Workshop on Algorithms and Data Structures, pp. 339\u2013350. Springer (2009)","DOI":"10.1007\/978-3-642-03367-4_30"},{"key":"1275_CR19","unstructured":"Hellyer, M.: Thinking through submarine transition (2018). https:\/\/www.aspi.org.au\/report\/thinking-through-submarine-transition"},{"key":"1275_CR20","unstructured":"Kahagalage, S.D.: A study of optimised network flows for prediction of force transmission and crack propagation in bonded granular media. Ph.D. thesis (2020)"},{"key":"1275_CR21","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.asoc.2017.10.035","volume":"62","author":"M Karatas","year":"2018","unstructured":"Karatas, M., Yak\u0131c\u0131, E.: An iterative solution approach to a multi-objective facility location problem. Appl. Soft Comput. 62, 272\u2013287 (2018)","journal-title":"Appl. Soft Comput."},{"key":"1275_CR22","doi-asserted-by":"crossref","unstructured":"Karatas, M., Yak\u0131c\u0131, E., Razi, N.: Military facility location problems: A brief survey. In: Operations Research for Military Organizations, pp. 1\u201327. IGI Global (2019)","DOI":"10.4018\/978-1-5225-5513-1.ch001"},{"key":"1275_CR23","unstructured":"Knowles, J.D., Corne, D.W., Fleischer, M.: Bounded archiving using the Lebesgue measure. In: The 2003 Congress on Evolutionary Computation, 2003. CEC\u201903., vol.\u00a04, pp. 2490\u20132497. IEEE (2003)"},{"issue":"12","key":"1275_CR24","doi-asserted-by":"publisher","first-page":"2568","DOI":"10.1109\/TCYB.2014.2310651","volume":"44","author":"M Li","year":"2014","unstructured":"Li, M., Yang, S., Liu, X.: Diversity comparison of pareto front approximations in many-objective optimization. IEEE Trans. Cybern. 44(12), 2568\u20132584 (2014)","journal-title":"IEEE Trans. Cybern."},{"issue":"3","key":"1275_CR25","first-page":"1002","volume":"29","author":"BT Liu","year":"2008","unstructured":"Liu, B.T., Tian, Z., Li, X.B., Zhou, Q.F., et al.: Multiscale SAR image segmentation based on Gomory\u2013Hu algorithm. J. Astronaut. 29(3), 1002\u20131007 (2008)","journal-title":"J. Astronaut."},{"issue":"12","key":"1275_CR26","doi-asserted-by":"publisher","first-page":"2421","DOI":"10.4304\/jsw.6.12.2421-2425","volume":"6","author":"X Liu","year":"2011","unstructured":"Liu, X., Lin, H., Tian, Y.: Segmenting webpage with Gomory\u2013Hu tree based clustering. JSW 6(12), 2421\u20132425 (2011)","journal-title":"JSW"},{"key":"1275_CR27","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ib\u00e1nez, M., Knowles, J., Laumanns, M.: On sequential online archiving of objective vectors. In: International Conference on Evolutionary Multi-Criterion Optimization, pp. 46\u201360. Springer (2011)","DOI":"10.1007\/978-3-642-19893-9_4"},{"issue":"5","key":"1275_CR28","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1023\/A:1008934512672","volume":"11","author":"B Malakooti","year":"2000","unstructured":"Malakooti, B., Raman, V.: Clustering and selection of multiple criteria alternatives using unsupervised and supervised neural networks. J. Intell. Manuf. 11(5), 435\u2013451 (2000)","journal-title":"J. Intell. Manuf."},{"issue":"6","key":"1275_CR29","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1080\/0305215042000274942","volume":"36","author":"CA Mattson","year":"2004","unstructured":"Mattson, C.A., Mullur, A.A., Messac, A.: Smart pareto filter: obtaining a minimal representation of multiobjective design space. Eng. Optim. 36(6), 721\u2013740 (2004)","journal-title":"Eng. Optim."},{"issue":"2","key":"1275_CR30","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.amc.2009.03.037","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas, G.: Effective implementation of the $$\\varepsilon $$-constraint method in multi-objective mathematical programming problems. Appl. Math. Comput. 213(2), 455\u2013465 (2009)","journal-title":"Appl. Math. Comput."},{"key":"1275_CR31","doi-asserted-by":"crossref","unstructured":"Miettinen, K.: Some methods for nonlinear multi-objective optimization. In: International Conference on Evolutionary Multi-criterion Optimization, pp. 1\u201320. Springer (2001)","DOI":"10.1007\/3-540-44719-9_1"},{"key":"1275_CR32","volume-title":"Nonlinear Multiobjective Optimization","author":"K Miettinen","year":"2012","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization, vol. 12. Springer, Berlin (2012)"},{"key":"1275_CR33","doi-asserted-by":"crossref","unstructured":"Mitrofanova, A., Farach-Colton, M., Mishra, B.: Efficient and robust prediction algorithms for protein complexes using Gomory\u2013Hu trees. In: Biocomputing 2009, pp. 215\u2013226. World Scientific (2009)","DOI":"10.1142\/9789812836939_0021"},{"issue":"1","key":"1275_CR34","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ejor.2021.04.053","volume":"297","author":"S Petchrompo","year":"2022","unstructured":"Petchrompo, S., Wannakrairot, A., Parlikad, A.K.: Pruning pareto optimal solutions for multi-objective portfolio asset management. Eur. J. Oper. Res. 297(1), 203\u2013220 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"1275_CR35","doi-asserted-by":"crossref","unstructured":"Ramirez, J.M., Medina, M.A., Coello, C.A.C.: A multiobjective teaching-learning algorithm for power losses reduction in power systems. In: Classical and Recent Aspects of Power System Optimization, pp. 505\u2013542. Elsevier (2018)","DOI":"10.1016\/B978-0-12-812441-3.00018-5"},{"key":"1275_CR36","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987)","journal-title":"J. Comput. Appl. Math."},{"issue":"3\u20135","key":"1275_CR37","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0270-0255(87)90473-8","volume":"9","author":"RW Saaty","year":"1987","unstructured":"Saaty, R.W.: The analytic hierarchy process-what it is and how it is used. Math. Modelling 9(3\u20135), 161\u2013176 (1987)","journal-title":"Math. Modelling"},{"key":"1275_CR38","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.knosys.2019.03.002","volume":"174","author":"JM Sanchez-Gomez","year":"2019","unstructured":"Sanchez-Gomez, J.M., Vega-Rodr\u00edguez, M.A., P\u00e9rez, C.J.: Comparison of automatic methods for reducing the pareto front to a single solution applied to multi-document text summarization. Knowl.-Based Syst. 174, 123\u2013136 (2019)","journal-title":"Knowl.-Based Syst."},{"issue":"23","key":"1275_CR39","doi-asserted-by":"publisher","first-page":"3102","DOI":"10.1093\/bioinformatics\/btt536","volume":"29","author":"T Schnattinger","year":"2013","unstructured":"Schnattinger, T., Sch\u00f6ning, U., Marchfelder, A., Kestler, H.A.: RNA-pareto: interactive analysis of pareto-optimal RNA sequence-structure alignments. Bioinformatics 29(23), 3102\u20133104 (2013)","journal-title":"Bioinformatics"},{"key":"1275_CR40","doi-asserted-by":"crossref","unstructured":"Selvi, S.T., Baskar, S., Rajasekar, S.: Application of evolutionary algorithm for multiobjective transformer design optimization. In: Classical and recent aspects of power system optimization, pp. 463\u2013504. Elsevier (2018)","DOI":"10.1016\/B978-0-12-812441-3.00017-3"},{"issue":"3","key":"1275_CR41","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.ress.2006.04.014","volume":"92","author":"HA Taboada","year":"2007","unstructured":"Taboada, H.A., Baheranwala, F., Coit, D.W., Wattanapongsakorn, N.: Practical solutions for multi-objective optimization: An application to system reliability design problems. Reliab. Eng. Syst. Saf. 92(3), 314\u2013322 (2007)","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"1275_CR42","doi-asserted-by":"crossref","unstructured":"Tordesillas, A., Kahagalage, S., Campbell, L., Bellett, P., Batterham, R.: Introducing a data-driven framework for spatiotemporal slope stability analytics for failure estimation. Tech. rep, Australian Centre for Geomechanics (2021)","DOI":"10.36487\/ACG_repo\/2135_14"},{"issue":"1","key":"1275_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-021-88836-x","volume":"11","author":"A Tordesillas","year":"2021","unstructured":"Tordesillas, A., Kahagalage, S., Campbell, L., Bellett, P., Intrieri, E., Batterham, R.: Spatiotemporal slope stability analytics for failure estimation (SSSAFE): linking radar data to the fundamental dynamics of granular failure. Sci. Rep. 11(1), 1\u201318 (2021)","journal-title":"Sci. Rep."},{"issue":"1","key":"1275_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-020-76616-y","volume":"10","author":"A Tordesillas","year":"2020","unstructured":"Tordesillas, A., Kahagalage, S., Ras, C., Nitka, M., Tejchman, J.: Early prediction of macrocrack location in concrete, rocks and other granular composite materials. Sci. Rep. 10(1), 1\u201316 (2020)","journal-title":"Sci. Rep."},{"issue":"10","key":"1275_CR45","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1002\/prot.22741","volume":"78","author":"N Tuncbag","year":"2010","unstructured":"Tuncbag, N., Salman, F.S., Keskin, O., Gursoy, A.: Analysis and network representation of hotspots in protein interfaces using minimum cut trees. Proteins Struct. Funct. Bioinf. 78(10), 2283\u20132294 (2010)","journal-title":"Proteins Struct. Funct. Bioinf."},{"key":"1275_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.113158","volume":"145","author":"HH Turan","year":"2020","unstructured":"Turan, H.H., Elsawah, S., Ryan, M.J.: A long-term fleet renewal problem under uncertainty: a simulation-based optimization approach. Expert Syst. Appl. 145, 113158 (2020)","journal-title":"Expert Syst. Appl."},{"key":"1275_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115751","volume":"186","author":"HH Turan","year":"2021","unstructured":"Turan, H.H., Kahagalage, S.D., Jalalvand, F., El Sawah, S.: A multi-objective simulation-optimization for a joint problem of strategic facility location, workforce planning, and capacity allocation: A case study in the royal australian navy. Expert Syst. Appl. 186, 115751 (2021)","journal-title":"Expert Syst. Appl."},{"key":"1275_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106400","volume":"146","author":"GK Tutunchi","year":"2020","unstructured":"Tutunchi, G.K., Fathi, Y.: Representative subsets of non-dominated points in the bi-criteria p-median p-dispersion problem. Comput. Ind. Eng. 146, 106400 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"1275_CR49","doi-asserted-by":"crossref","unstructured":"Veerappa, V., Letier, E.: Understanding clusters of optimal solutions in multi-objective decision problems. In: 2011 IEEE 19Th International Requirements Engineering Conference, pp. 89\u201398. IEEE (2011)","DOI":"10.1109\/RE.2011.6051654"},{"key":"1275_CR50","doi-asserted-by":"crossref","unstructured":"Wang, F., Franco-Penya, H.H., Kelleher, J.D., Pugh, J., Ross, R.: An analysis of the application of simplified silhouette to the evaluation of k-means clustering validity. In: International Conference on Machine Learning and Data Mining in Pattern Recognition, pp. 291\u2013305. Springer (2017)","DOI":"10.1007\/978-3-319-62416-7_21"},{"issue":"6","key":"1275_CR51","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1109\/TCYB.2016.2550502","volume":"47","author":"H Wang","year":"2016","unstructured":"Wang, H., Jin, Y., Yao, X.: Diversity assessment in many-objective optimization. IEEE Trans. Cybern. 47(6), 1510\u20131522 (2016)","journal-title":"IEEE Trans. Cybern."},{"issue":"2","key":"1275_CR52","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1214\/20-AOAS1326","volume":"14","author":"S Zhou","year":"2020","unstructured":"Zhou, S., Bondell, H., Tordesillas, A., Rubinstein, B.I., Bailey, J.: Early identification of an impending rockslide location via a spatially-aided gaussian mixture model. Ann. Appl. Stat. 14(2), 977\u2013992 (2020)","journal-title":"Ann. Appl. Stat."},{"key":"1275_CR53","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm. TIK-report 103 (2001)"},{"key":"1275_CR54","unstructured":"Zitzler, E., Thiele, L.: An evolutionary algorithm for multiobjective optimization: The strength pareto approach. TIK-report 43 (1998)"},{"issue":"2","key":"1275_CR55","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: An analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01275-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01275-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01275-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:58:48Z","timestamp":1729029528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01275-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,7]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1275"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01275-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,7]]},"assertion":[{"value":"30 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}