A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
How to Evaluate Solutions in Pareto-based Search-Based Software Engineering A Critical Review and Methodological Guidance
2020
IEEE Transactions on Software Engineering
With modern requirements, there is an increasing tendency of considering multiple objectives/criteria simultaneously in many Software Engineering (SE) scenarios. Such a multi-objective optimization scenario comes with an important issue -how to evaluate the outcome of optimization algorithms, which typically is a set of incomparable solutions (i.e., being Pareto nondominated to each other). This issue can be challenging for the SE community, particularly for practitioners of Search-Based SE
doi:10.1109/tse.2020.3036108
fatcat:jwdvp4v4sjd2xkuxfprumgnqam