{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:27:50Z","timestamp":1648769270499},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"4","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["146371743-TRR 89"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM Trans. Evol. Learn. Optim."],"published-print":{"date-parts":[[2021,12,31]]},"abstract":"\n Real-world problems typically require the simultaneous optimization of multiple, often conflicting objectives. Many of these\n multi-objective optimization problems<\/jats:italic>\n are characterized by wide ranges of uncertainties in their decision variables or objective functions. To cope with such uncertainties,\n stochastic<\/jats:italic>\n and\n robust optimization<\/jats:italic>\n techniques are widely studied aiming to distinguish candidate solutions with uncertain objectives specified by confidence intervals, probability distributions, sampled data, or uncertainty sets. In this scope, this article first introduces a novel empirical approach for the comparison of candidate solutions with uncertain objectives that can follow arbitrary distributions. The comparison is performed through accurate and efficient calculations of the probability that one solution dominates the other in terms of each uncertain objective. Second, such an operator can be flexibly used and combined with many existing multi-objective optimization frameworks and techniques by just substituting their standard comparison operator, thus easily enabling the Pareto front optimization of problems with multiple uncertain objectives. Third, a new benchmark for evaluating uncertainty-aware optimization techniques is introduced by incorporating different types of uncertainties into a well-known benchmark for multi-objective optimization problems. Fourth, the new comparison operator and benchmark suite are integrated into an existing multi-objective optimization framework that features a selection of multi-objective optimization problems and algorithms. Fifth, the efficiency in terms of performance and execution time of the proposed comparison operator is evaluated on the introduced uncertainty benchmark. Finally, statistical tests are applied giving evidence of the superiority of the new comparison operator in terms of\n \n \\epsilon<\/jats:tex-math>\n <\/jats:inline-formula>\n -dominance and attainment surfaces in comparison to previously proposed approaches.\n <\/jats:p>","DOI":"10.1145\/3469801","type":"journal-article","created":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T22:05:35Z","timestamp":1634162735000},"page":"1-26","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Computation of Probabilistic Dominance in Multi-objective Optimization"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-9032-4751","authenticated-orcid":false,"given":"Faramarz","family":"Khosravi","sequence":"first","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Erlangen, Germany"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1274-6398","authenticated-orcid":false,"given":"Alexander","family":"Rass","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Erlangen, Germany"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6285-5862","authenticated-orcid":false,"given":"J\u00fcrgen","family":"Teich","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Erlangen, Germany"}]}],"member":"320","reference":[{"key":"e_1_3_2_2_2","volume-title":"Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables","author":"Abramowitz Milton","year":"1964"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2007.03.003"},{"key":"e_1_3_2_4_2","volume-title":"Introduction to Stochastic Programming","author":"Birge John R.","year":"1997"},{"key":"e_1_3_2_5_2","volume-title":"Retrieved from http:\/\/wrap.warwick.ac.uk\/55724","author":"Branke J\u00fcrgen","year":"2013"},{"issue":"2","key":"e_1_3_2_6_2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s40747-019-0113-4","article-title":"Evolutionary multiobjective optimization: open research areas and some challenges lying ahead","volume":"6","author":"Coello Carlos A. Coello","year":"2020","journal-title":"Complex Intell. Syst."},{"key":"e_1_3_2_7_2","first-page":"849","volume-title":"Proceedings of the Parallel Problem Solving from Nature","author":"Deb Kalyanmoy","year":"2000"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2006.14.4.463"},{"key":"e_1_3_2_9_2","first-page":"825","volume-title":"Proceedings of the IEEE Congress on Evolutionary Computation","author":"Deb Kalyanmoy","year":"2002"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/1869916"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728174"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.03.013"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35813-5_9"},{"key":"e_1_3_2_14_2","first-page":"243","volume-title":"Proceedings of the IEEE Congress on Evolutionary Computation","volume":"1","author":"Fieldsend Jonathan E.","year":"2005"},{"issue":"1","key":"e_1_3_2_15_2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/TEVC.2016.2634625","article-title":"A set-based genetic algorithm for interval many-objective optimization problems","volume":"22","author":"Gong Dunwei","year":"2016","journal-title":"IEEE Trans. Evolution. Comput."},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-013-1369-5"},{"issue":"2","key":"e_1_3_2_17_2","first-page":"316","article-title":"Robust multiobjective optimization via evolutionary algorithms","volume":"23","author":"He Zhenan","year":"2018","journal-title":"IEEE Trans. Evolution. Comput."},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","first-page":"329","volume-title":"Proceedings of the International Conference on Evolutionary Multi-Criterion Optimization","author":"Hughes Evan J.","year":"2001","DOI":"10.1007\/3-540-44719-9_23"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.846356"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.07.035"},{"key":"e_1_3_2_21_2","first-page":"1","volume-title":"Proceedings of the IEEE Congress on Evolutionary Computation","author":"Khosravi Faramarz","year":"2018"},{"key":"e_1_3_2_22_2","first-page":"97","volume-title":"Proceedings of the Design, Automation and Test in Europe","author":"Khosravi Faramarz","year":"2015"},{"key":"e_1_3_2_23_2","volume-title":"TIK-Report No. 214, Computer Engineering and Networks Laboratory, ETH Zurich","author":"Knowles Joshua D.","year":"2006"},{"issue":"2","key":"e_1_3_2_24_2","first-page":"305","article-title":"On robust multiobjective optimization","volume":"40","author":"Kuroiwa Daishi","year":"2012","journal-title":"Vietnam J. Math."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2310651"},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","first-page":"413","volume-title":"Proceedings of the Evolutionary Multi-Criterion Optimization","author":"Limbourg Philipp","year":"2005","DOI":"10.1007\/978-3-540-31880-4_29"},{"key":"e_1_3_2_27_2","first-page":"1723","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"Lukasiewycz Martin","year":"2011"},{"issue":"1","key":"e_1_3_2_28_2","first-page":"77","article-title":"Portfolio selection","volume":"7","author":"Markowitz Harry","year":"1952","journal-title":"J. Finance"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2012.04.056"},{"key":"e_1_3_2_30_2","article-title":"Comparing solutions under uncertainty in multiobjective optimization","volume":"2014","author":"Mlakar Miha","year":"2014","journal-title":"Math. Problems Eng."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2004.03.002"},{"issue":"3","key":"e_1_3_2_32_2","first-page":"287","article-title":"Multi-objective particle swarm optimizers: A survey of the state-of-the-art","volume":"2","author":"Reyes-Sierra Margarita","year":"2006","journal-title":"Int. J. Comput. Intell. Res."},{"key":"e_1_3_2_33_2","first-page":"317","volume-title":"Proceedings of the IEEE International Conference on Data Engineering","author":"Soliman Mohamed A.","year":"2009"},{"key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"314","volume-title":"Proceedings of the International Conference on Evolutionary Multi-Criterion Optimization","author":"Teich J\u00fcrgen","year":"2001","DOI":"10.1007\/3-540-44719-9_22"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2011.2161029"},{"issue":"9","key":"e_1_3_2_36_2","doi-asserted-by":"crossref","first-page":"1997","DOI":"10.1109\/TCYB.2015.2459137","article-title":"Regularity model for noisy multiobjective optimization","volume":"46","author":"Wang Handing","year":"2015","journal-title":"IEEE Trans. Cybernet."},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568202"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"}],"container-title":["ACM Transactions on Evolutionary Learning and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3469801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T22:13:49Z","timestamp":1634163229000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3469801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,31]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12,31]]}},"alternative-id":["10.1145\/3469801"],"URL":"http:\/\/dx.doi.org\/10.1145\/3469801","relation":{},"ISSN":["2688-299X","2688-3007"],"issn-type":[{"value":"2688-299X","type":"print"},{"value":"2688-3007","type":"electronic"}],"published":{"date-parts":[[2021,12,31]]}}}