{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:48:22Z","timestamp":1753890502532,"version":"3.41.2"},"reference-count":42,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T00:00:00Z","timestamp":1684886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100009483","name":"Universidad Tecnol\u00f3gica Nacional","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009483","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Comput. Sci."],"abstract":"<jats:sec><jats:title>Introduction<\/jats:title><jats:p>When solving multi-objective combinatorial optimization problems using a search algorithm without a priori information, the result is a Pareto front. Selecting a solution from it is a laborious task if the number of solutions to be analyzed is large. This task would benefit from a systematic approach that facilitates the analysis, comparison and selection of a solution or a group of solutions based on the preferences of the decision makers. In the last decade, the research and development of algorithms for solving multi-objective combinatorial optimization problems has been growing steadily. In contrast, efforts in the a posteriori exploration of non-dominated solutions are still scarce.<\/jats:p><\/jats:sec><jats:sec><jats:title>Methods<\/jats:title><jats:p>This paper proposes an abstract framework based on hierarchical clustering in order to facilitate decision makers to explore such a Pareto front in search of a solution or a group of solutions according to their preferences. An extension of that abstract framework aimed at addressing the bi-objective Next Release Problem is presented, together with a Dashboard that implements that extension. Based on this implementation, two studies are conducted. The first is a usability study performed with a small group of experts. The second is a performance analysis based on computation time consumed by the clustering algorithm.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>The results of the initial empirical usability study are promising and indicate directions for future improvements. The experts were able to correctly use the dashboard and properly interpret the visualizations in a very short time. In the same direction, the results of the performance comparison highlight the advantage of the hierarchical clustering-based approach in terms of response time.<\/jats:p><\/jats:sec><jats:sec><jats:title>Discussion<\/jats:title><jats:p>Based on these excellent results, the extension of the framework to new problems is planned, as well as the implementation of new validity tests with expert decision makers using real-world data.<\/jats:p><\/jats:sec>","DOI":"10.3389\/fcomp.2023.1179059","type":"journal-article","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T04:51:00Z","timestamp":1684903860000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Hierarchical clustering-based framework for a posteriori exploration of Pareto fronts: application on the bi-objective next release problem"],"prefix":"10.3389","volume":"5","author":[{"given":"Carlos","family":"Casanova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esteban","family":"Schab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucas","family":"Prado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni Dai\u00e1n","family":"Rottoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1965","published-online":{"date-parts":[[2023,5,24]]},"reference":[{"key":"B1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-14142-8","volume-title":"Data Mining: The Textbook","author":"Aggarwal","year":"2015"},{"key":"B2","first-page":"464","article-title":"\u201cReducing interactive refactoring effort via clustering-based multi-objective search,\u201d","volume-title":"2018 33rd IEEE\/ACM International Conference on Automated Software Engineering (ASE)","author":"Alizadeh","year":"2018"},{"key":"B3","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/S0950-5849(01)00194-X","article-title":"The next release problem","volume":"43","author":"Bagnall","year":"2001","journal-title":"Inform. Softw. Technol"},{"volume-title":"SWEBOK: Guide to the Software Engineering Body of Knowledge","year":"2014","author":"Bourque","key":"B4"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7692504","article-title":"Giicis\/clustering based pareto front exploration: Release for publication, Version v.2023.1","author":"Casanova","year":"2023","journal-title":"Zenodo"},{"key":"B6","first-page":"509","article-title":"\u201cFuzzy bi-objective particle swarm optimization for next release problem,\u201d","volume-title":"International Conference on Software Engineering and Knowledge Engineering (SEKE'19)","author":"Casanova","year":"2019"},{"key":"B7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3514233","article-title":"The weights can be harmful: Pareto search versus weighted search in multi-objective search-based software engineering","volume":"32","author":"Chen","year":"2022","journal-title":"ACM Trans. Softw. Eng. Methodol"},{"key":"B8","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1109\/CEC.2015.7256991","article-title":"\u201cReference vector based a posteriori preference articulation for evolutionary multiobjective optimization,\u201d","volume-title":"2015 IEEE Congress on Evolutionary Computation (CEC)","author":"Cheng","year":"2015"},{"key":"B9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1093\/jigpal\/jzz074","article-title":"Collective intelligence approaches in interactive evolutionary multi-objective optimization","volume":"28","author":"Cinalli","year":"2020","journal-title":"Logic J. IGPL"},{"key":"B10","first-page":"849","article-title":"\u201cA fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II,\u201d","volume-title":"International Conference on Parallel Problem Solving from Nature","author":"Deb","year":"2000"},{"key":"B11","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1002\/cplx.21739","article-title":"Three steps multiobjective decision process for software release planning","volume":"21","author":"Del \u00c1guila","year":"2016","journal-title":"Complexity"},{"key":"B12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.jss.2019.06.097","article-title":"Efficient anytime algorithms to solve the bi-objective next release problem","volume":"156","author":"Dom\u00ednguez-R\u00edos","year":"2019","journal-title":"J. Syst. Softw."},{"key":"B13","doi-asserted-by":"publisher","first-page":"106825","DOI":"10.1016\/j.infsof.2022.106825","article-title":"Multi-objective integer programming approaches to next release problem-enhancing exact methods for finding whole pareto front","volume":"147","author":"Dong","year":"2022","journal-title":"Inform. Softw. Technol."},{"key":"B14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.infsof.2017.05.003","article-title":"Incorporating user preferences in search-based software engineering: A systematic mapping study","volume":"90","author":"Ferreira","year":"2017","journal-title":"Inform. Softw. Technol."},{"key":"B15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/COMPSAC.2019.00028","article-title":"\u201cSupporting decision makers in search-based product line architecture design using clustering,\u201d","volume-title":"2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)","author":"Freire","year":"2019"},{"key":"B16","first-page":"402","article-title":"\u201cInformation mining processes based on intelligent systems,\u201d","volume-title":"International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems","author":"Garc\u00eda-Mart\u00ednez","year":"2013"},{"year":"2011","author":"Han","journal-title":"Data Mining: Concepts and Techniques","key":"B17"},{"key":"B18","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/S0950-5849(01)00189-6","article-title":"Search-based software engineering","volume":"43","author":"Harman","year":"2001","journal-title":"Inform. Softw. Technol."},{"key":"B19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25231-0_1","article-title":"\u201cSearch based software engineering: Techniques, taxonomy, tutorial,\u201d","author":"Harman","year":"2012","journal-title":"Empirical Software Engineering and Verification: International Summer Schools, LASER 2008-2010, Elba Island, Italy, Revised Tutorial Lectures"},{"key":"B20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2020.05.103","article-title":"Reformulating preferences into constraints for evolutionary multi- and many-objective optimization","volume":"541","author":"Hou","year":"2020","journal-title":"Inform. Sci."},{"key":"B21","first-page":"1","article-title":"\u201cThree-step optimization method based on posteriori satisfying degree for fuzzy multiple objective optimization,\u201d","volume-title":"2011 International Conference on Control, Automation and Systems Engineering (CASE)","author":"Hu","year":"2011"},{"key":"B22","doi-asserted-by":"publisher","first-page":"2758","DOI":"10.1109\/TCYB.2018.2834466","article-title":"A clustering-based adaptive evolutionary algorithm for multiobjective optimization with irregular pareto fronts","volume":"49","author":"Hua","year":"2019","journal-title":"IEEE Trans. Cybernet."},{"key":"B23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-7138-7","volume-title":"An Introduction to Statistical Learning","author":"James","year":"2013"},{"key":"B24","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.ejor.2017.01.003","article-title":"Weighted sum model with partial preference information: application to multi-objective optimization","volume":"260","author":"Kaddani","year":"2017","journal-title":"Eur. J. Oper. Res."},{"volume-title":"Fuzzy Sets and Fuzzy Logic: Theory and Applications","year":"1994","author":"Klir","key":"B25"},{"key":"B26","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ins.2022.09.001","article-title":"Finding top-k solutions for the decision-maker in multiobjective optimization","volume":"613","author":"Luo","year":"2022","journal-title":"Inform. Sci."},{"key":"B27","first-page":"567","article-title":"\u201cBioinspired computation in combinatorial optimization: Algorithms and their computational complexity,\u201d","volume-title":"Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO '13 Companion","author":"Neumann","year":"2013"},{"year":"1998","author":"Papadimitriou","journal-title":"Combinatorial Optimization: Algorithms and Complexity","key":"B28"},{"key":"B29","doi-asserted-by":"publisher","first-page":"1560","DOI":"10.1109\/TSE.2020.3024814","article-title":"Enabling decision and objective space exploration for interactive multi-objective refactoring","volume":"48","author":"Rebai","year":"2020","journal-title":"IEEE Trans. Softw. Eng."},{"key":"B30","doi-asserted-by":"publisher","first-page":"105134","DOI":"10.1016\/j.envsoft.2021.105134","article-title":"Multi-scenario multi-objective robust optimization under deep uncertainty: a posteriori approach","volume":"144","author":"Shavazipour","year":"","journal-title":"Environ. Modell. Softw."},{"key":"B31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2021.07.025","article-title":"Visualizations for decision support in scenario-based multiobjective optimization","volume":"578","author":"Shavazipour","year":"","journal-title":"Inform. Sci."},{"key":"B32","first-page":"1","article-title":"\u201cA typology of stakeholder identification methods for projects in software industry,\u201d","volume-title":"MESM'2014","author":"Sudevan","year":"2014"},{"key":"B33","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1109\/5.949485","article-title":"Interactive evolutionary computation: fusion of the capabilities of ec optimization and human evaluation","volume":"89","author":"Takagi","year":"2001","journal-title":"Proc. IEEE"},{"key":"B34","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.ins.2022.10.064","article-title":"Interactive co-evolutionary multiple objective optimization algorithms for finding consensus solutions for a group of decision makers","volume":"616","author":"Tomczyk","year":"2022","journal-title":"Inform. Sci."},{"key":"B35","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s00766-005-0021-6","article-title":"Requirements engineering paper classification and evaluation criteria: a proposal and a discussion","volume":"11","author":"Wieringa","year":"2006","journal-title":"Req. Eng."},{"key":"B36","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1109\/TSE.2011.92","article-title":"Solving the large scale next release problem with a backbone-based multilevel algorithm","volume":"38","author":"Xuan","year":"2012","journal-title":"IEEE Trans. Softw. Eng."},{"key":"B37","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3110780","article-title":"Solution of large-scale many-objective optimization problems based on dimension reduction and solving knowledge guided evolutionary algorithm","author":"Yao","year":"2021","journal-title":"IEEE Trans. Evol. Comput."},{"key":"B38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/CEC.2018.8477885","article-title":"\u201cA method for a posteriori identification of knee points based on solution density,\u201d","volume-title":"2018 IEEE Congress on Evolutionary Computation (CEC)","author":"Yu","year":"2018"},{"key":"B39","doi-asserted-by":"publisher","first-page":"4005","DOI":"10.1007\/s00500-015-1736-z","article-title":"Decomposing the user-preference in multiobjective optimization","volume":"20","author":"Yu","year":"2016","journal-title":"Soft Comput."},{"key":"B40","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s00607-021-00995-x","article-title":"A multi-objective optimization algorithm based on dynamic user-preference information","volume":"104","author":"Yu","year":"2022","journal-title":"Computing"},{"key":"B41","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1145\/1276958.1277179","article-title":"\u201cThe multi-objective next release problem,\u201d","volume-title":"Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO '07","author":"Zhang","year":"2007"},{"key":"B42","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1007\/978-3-540-30217-9_84","article-title":"\u201cIndicator-based selection in multiobjective search,\u201d","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"Zitzler","year":"2004"}],"container-title":["Frontiers in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fcomp.2023.1179059\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T04:51:12Z","timestamp":1684903872000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fcomp.2023.1179059\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,24]]},"references-count":42,"alternative-id":["10.3389\/fcomp.2023.1179059"],"URL":"https:\/\/doi.org\/10.3389\/fcomp.2023.1179059","relation":{},"ISSN":["2624-9898"],"issn-type":[{"type":"electronic","value":"2624-9898"}],"subject":[],"published":{"date-parts":[[2023,5,24]]},"article-number":"1179059"}}