Hierarchical clustering-based framework for a posteriori exploration of Pareto fronts: application on the bi-objective next release problem

被引:2
|
作者
Casanova, Carlos [1 ]
Schab, Esteban [1 ]
Prado, Lucas [1 ]
Rottoli, Giovanni Daian [1 ]
机构
[1] Natl Technol Univ, Concepcion Uruguay Reg Fac, Informat Syst Dept, Computat Intelligence & Software Engn Res Grp, Concepcion Uruguay, Entre Rios, Argentina
来源
FRONTIERS IN COMPUTER SCIENCE | 2023年 / 5卷
关键词
search-based software engineering; preference-based algorithms; a posteriori approach; hierarchical clustering; multiobjective optimization; Pareto front; DECISION; OPTIMIZATION; PREFERENCES;
D O I
10.3389/fcomp.2023.1179059
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
IntroductionWhen 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. MethodsThis 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. ResultsThe 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. DiscussionBased 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.
引用
收藏
页数:18
相关论文
共 12 条
  • [1] A study of the bi-objective next release problem
    Durillo, Juan J.
    Zhang, Yuanyuan
    Alba, Enrique
    Harman, Mark
    Nebro, Antonio J.
    EMPIRICAL SOFTWARE ENGINEERING, 2011, 16 (01) : 29 - 60
  • [2] A study of the bi-objective next release problem
    Juan J. Durillo
    Yuanyuan Zhang
    Enrique Alba
    Mark Harman
    Antonio J. Nebro
    Empirical Software Engineering, 2011, 16 : 29 - 60
  • [3] Efficient anytime algorithms to solve the bi-objective Next Release Problem
    Angel Dominguez-Rios, Miguel
    Chicano, Francisco
    Alba, Enrique
    del Aguila, Isabel
    del Sagrado, Jose
    JOURNAL OF SYSTEMS AND SOFTWARE, 2019, 156 : 217 - 231
  • [4] An Integer Linear Programming approach to the single and bi-objective Next Release Problem
    Veerapen, Nadarajen
    Ochoa, Gabriela
    Harman, Mark
    Burke, Edmund K.
    INFORMATION AND SOFTWARE TECHNOLOGY, 2015, 65 : 1 - 13
  • [5] Characterization of graph properties for improved Pareto fronts using heuristics and EA for bi-objective graph coloring problem
    Saha, Soma
    Kumar, Rajeev
    Baboo, Gyan
    APPLIED SOFT COMPUTING, 2013, 13 (05) : 2812 - 2822
  • [6] A Pareto-Based Clustering Approach for Solving a Bi-Objective Mobile Hub Location Problem with Congestion
    Chenary, Maryam Dehghan
    Ferdowsi, Arman
    Hartl, Richard F.
    LOGISTICS-BASEL, 2024, 8 (04):
  • [7] An estimation of distribution algorithm based on interactions between requirements to solve the bi-objective Next Release Problem
    del Sagrado, Jose
    Sierra Ibanez, Jose Antonio
    del Aguila, Isabel M.
    JOURNAL OF SYSTEMS AND SOFTWARE, 2023, 199
  • [8] Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem
    Legrand, Clement
    Cattaruzza, Diego
    Jourdan, Laetitia
    Kessaci, Marie-Eleonore
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2025, 32 (01) : 117 - 143
  • [9] A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system
    Xu, Rui
    Chen, Huaping
    Li, Xueping
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 145 (01) : 371 - 386
  • [10] A bi-objective hierarchical program scheduling problem and its solution based on NSGA-III
    Peng, Wuliang
    Lin, Jiali
    Zhang, Jingwen
    Chen, Liangwei
    ANNALS OF OPERATIONS RESEARCH, 2022, 308 (1-2) : 389 - 414