{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T15:27:46Z","timestamp":1786116466918,"version":"build-2736575974"},"reference-count":42,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T00:00:00Z","timestamp":1785974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100018537","name":"Quantum Science and Technology\u2014National Science and Technology Major Project","doi-asserted-by":"publisher","award":["2021ZD0302900"],"award-info":[{"award-number":["2021ZD0302900"]}],"id":[{"id":"10.13039\/501100018537","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Search-based software engineering (SBSE) tackles critical optimization problems in software engineering, including the next release problem (NRP) and feature selection problem (FSP). Traditional heuristic approaches and integer linear programming (ILP) methods work well for small- to medium-scale problems but face growing computational cost as instances scale up. We investigate quantum annealing (QA) as an optimization subroutine for multi-objective SBSE problems. We propose two QA-based algorithms tailored to different problem scales. For small-scale problems, we reformulate multi-objective optimization (MOO) as single-objective optimization (SOO) using penalty-based mappings for quantum processing. For large-scale problems that exceed current hardware capacity, we employ a decomposition strategy guided by maximum energy impact (MEI) that partitions the problem into smaller sub-QUBOs, integrating QA with a steepest-descent method for local search. Applied to NRP and FSP, our approaches are benchmarked against the heuristic NSGA-II, IBEA, and MOEA\/D, as well as the ILP-based \u03f5-constraint method. The experimental results reveal that while our methods produce fewer non-dominated solutions than \u03f5-constraint, they achieve substantial reductions in execution time. Compared to the evolutionary baselines, our methods achieve competitive solution quality with lower runtime on the instances that they can encode. The penalty-based QUBO formulation fails to reach feasible regions on constraint-dense FSP instances, limiting the current applicability of the approach. QA is a promising but still hardware-limited component for multi-objective SBSE workflows, rather than a wholesale replacement for classical solvers.<\/jats:p>","DOI":"10.3390\/e28080886","type":"journal-article","created":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T09:46:38Z","timestamp":1786009598000},"page":"886","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems"],"prefix":"10.3390","volume":"28","author":[{"given":"Yuxuan","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China"},{"name":"Hefei National Laboratory, University of Science and Technology of China, Hefei 230088, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9588-8473","authenticated-orcid":false,"given":"Shuchang","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China"},{"name":"Hefei National Laboratory, University of Science and Technology of China, Hefei 230088, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China"},{"name":"Hefei National Laboratory, University of Science and Technology of China, Hefei 230088, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2026,8,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2379776.2379787","article-title":"Search-based software engineering: Trends, techniques and applications","volume":"45","author":"Harman","year":"2012","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1010035730904","article-title":"Aggregate objective functions and Pareto frontiers: Required relationships and practical implications","volume":"1","author":"Messac","year":"2000","journal-title":"Optim. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Harman, M., and Mansouri, S.A. (2007). The multi-objective next release problem. Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, Association for Computing Machinery.","DOI":"10.1145\/1276958.1277179"},{"key":"ref_4","unstructured":"Jiang, H., Zhang, J., Xuan, J., Ren, Z., and Hu, Y. (2010). A hybrid ACO algorithm for the next release problem. Proceedings of the 2nd International Conference on Software Engineering and Data Mining, IEEE."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"561","DOI":"10.18178\/ijmlc.2019.9.5.840","article-title":"Greedy binary particle swarm optimization for multi-objective constrained next release problem","volume":"9","author":"Hamdy","year":"2019","journal-title":"Int. J. Mach. Learn. Comput"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"6991","DOI":"10.1016\/j.aej.2021.12.043","article-title":"A hybrid multi-objective optimization algorithm for software requirement problem","volume":"61","author":"Marghny","year":"2022","journal-title":"Alex. Eng. J."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.infsof.2015.03.008","article-title":"An integer linear programming approach to the single and bi-objective next release problem","volume":"65","author":"Veerapen","year":"2015","journal-title":"Inf. Softw. Technol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"106825","DOI":"10.1016\/j.infsof.2022.106825","article-title":"Multi-objective integer programming approaches to Next Release Problem\u2014Enhancing exact methods for finding whole pareto front","volume":"147","author":"Dong","year":"2022","journal-title":"Inf. Softw. Technol."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2208","DOI":"10.1016\/j.jss.2011.06.026","article-title":"A genetic algorithm for optimized feature selection with resource constraints in software product lines","volume":"84","author":"Guo","year":"2011","journal-title":"J. Syst. Softw."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Sayyad, A.S., Ingram, J., Menzies, T., and Ammar, H. (2013). Optimum feature selection in software product lines: Let your model and values guide your search. Proceedings of the 2013 1st International Workshop on Combining Modelling and Search-Based Software Engineering (CMSBSE), IEEE.","DOI":"10.1109\/CMSBSE.2013.6604432"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1016\/j.asoc.2016.07.040","article-title":"IBED: Combining IBEA and DE for optimal feature selection in software product line engineering","volume":"49","author":"Xue","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"ref_12","first-page":"517","article-title":"Combining multi-objective search and constraint solving for configuring large software product lines","volume":"Volume 1","author":"Henard","year":"2015","journal-title":"Proceedings of the 2015 IEEE\/ACM 37th IEEE International Conference on Software Engineering"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1007\/s10270-017-0610-0","article-title":"SMTIBEA: A hybrid multi-objective optimization algorithm for configuring large constrained software product lines","volume":"18","author":"Guo","year":"2019","journal-title":"Softw. Syst. Model."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Xue, Y., and Li, Y.F. (2018). Multi-Objective Integer Programming Approaches for Solving Optimal Feature Selection Problem: A New Perspective on Multi-Objective Optimization Problems in SBSE. Proceedings of the ICSE \u201918: 40th International Conference on Software Engineering, Association for Computing Machinery.","DOI":"10.1145\/3180155.3180257"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1845","DOI":"10.1007\/s00366-021-01369-9","article-title":"A multi-objective optimization algorithm for feature selection problems","volume":"38","author":"Abdollahzadeh","year":"2022","journal-title":"Eng. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1021\/acs.iecr.6b03453","article-title":"Application and analysis of methods for selecting an optimal solution from the Pareto-optimal front obtained by multiobjective optimization","volume":"56","author":"Wang","year":"2017","journal-title":"Ind. Eng. Chem. Res."},{"key":"ref_17","unstructured":"Farhi, E., Goldstone, J., and Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"4213","DOI":"10.1038\/ncomms5213","article-title":"A variational eigenvalue solver on a photonic quantum processor","volume":"5","author":"Peruzzo","year":"2014","journal-title":"Nat. Commun."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","article-title":"Quantum-inspired evolutionary algorithm for a class of combinatorial optimization","volume":"6","author":"Han","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., and Katzgraber, H.G. (2019). Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. Front. Phys., 7.","DOI":"10.3389\/fphy.2019.00048"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/BF01011339","article-title":"The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines","volume":"22","author":"Benioff","year":"1980","journal-title":"J. Stat. Phys."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Association for Computing Machinery.","DOI":"10.1145\/237814.237866"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1038\/s41567-024-02765-w","article-title":"Stirring the false vacuum via interacting quantized bubbles on a 5,564-qubit quantum annealer","volume":"21","author":"Vodeb","year":"2025","journal-title":"Nat. Phys."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1103\/RevModPhys.80.1061","article-title":"Colloquium: Quantum annealing and analog quantum computation","volume":"80","author":"Das","year":"2008","journal-title":"Rev. Mod. Phys."},{"key":"ref_25","unstructured":"D-Wave Systems Inc. (2026, July 13). Energy-Impact Decomposing. Available online: https:\/\/docs.dwavequantum.com\/en\/latest\/quantum_research\/decomposing.html."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ejor.2008.10.023","article-title":"Multi-objective integer programming: A general approach for generating all non-dominated solutions","volume":"199","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.ins.2021.11.052","article-title":"An enhanced fast non-dominated solution sorting genetic algorithm for multi-objective problems","volume":"585","author":"Deng","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"110472","DOI":"10.1016\/j.asoc.2023.110472","article-title":"A comparative study on evolutionary multi-objective algorithms for next release problem","volume":"144","author":"Rahimi","year":"2023","journal-title":"Appl. Soft. Comput."},{"key":"ref_29","unstructured":"Karim, M.R., and Ruhe, G. (2014). Bi-objective genetic search for release planning in support of themes. Proceedings of the Search-Based Software Engineering: 6th International Symposium, SSBSE 2014, Fortaleza, Brazil, 26\u201329 August 2014, Springer. Proceedings 6."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.infsof.2017.03.001","article-title":"Minimizing the stakeholder dissatisfaction risk in requirement selection for next release planning","volume":"87","author":"Pitangueira","year":"2017","journal-title":"Inf. Softw. Technol."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3196831","article-title":"An empirical study of meta-and hyper-heuristic search for multi-objective release planning","volume":"27","author":"Zhang","year":"2018","journal-title":"ACM Trans. Softw. Eng. Methodol. (TOSEM)"},{"key":"ref_32","doi-asserted-by":"crossref","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":"ref_33","unstructured":"Mendonca, M., Branco, M., and Cowan, D. (2009). SPLOT: Software product lines online tools. Proceedings of the 24th ACM SIGPLAN Conference Companion on Object Oriented Programming Systems Languages and Applications, Association for Computing Machinery."},{"key":"ref_34","unstructured":"Berger, T., She, S., Lotufo, R., Wasowski, A., and Czarnecki, K. (2012). Variability Modeling in the Systems Software Domain, Generative Software Development Laboratory, University of Waterloo. GSDLAB Technical Report."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Sayyad, A.S., Menzies, T., and Ammar, H. (2013). On the value of user preferences in search-based software engineering: A case study in software product lines. Proceedings of the 2013 35th International Conference on Software Engineering (ICSE), IEEE.","DOI":"10.1109\/ICSE.2013.6606595"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Tan, T.H., Xue, Y., Chen, M., Sun, J., Liu, Y., and Dong, J.S. (2015). Optimizing selection of competing features via feedback-directed evolutionary algorithms. Proceedings of the 2015 International Symposium on Software Testing and Analysis, Association for Computing Machinery.","DOI":"10.1145\/2771783.2771808"},{"key":"ref_37","unstructured":"IBM ILOG CPLEX (2009). IBM ILOG CPLEX V12.1: User\u2019s Manual for CPLEX, IBM Corporation."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.ejor.2020.11.016","article-title":"Performance indicators in multiobjective optimization","volume":"292","author":"Audet","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","article-title":"MOEA\/D: A multiobjective evolutionary algorithm based on decomposition","volume":"11","author":"Zhang","year":"2007","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1609\/socs.v7i1.18390","article-title":"A hybrid quantum-classical approach to solving scheduling problems","volume":"Volume 7","author":"Tran","year":"2016","journal-title":"Proceedings of the International Symposium on Combinatorial Search"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1038\/s42254-024-00770-9","article-title":"Challenges and opportunities in quantum optimization","volume":"6","author":"Abbas","year":"2024","journal-title":"Nat. Rev. Phys."},{"key":"ref_42","unstructured":"McGeoch, C., and Farr\u00e9, P. (2020). D-Wave Hybrid Solver Service: An Overview, D-Wave System."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/8\/886\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T09:49:36Z","timestamp":1786009776000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/8\/886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,6]]},"references-count":42,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2026,8]]}},"alternative-id":["e28080886"],"URL":"https:\/\/doi.org\/10.3390\/e28080886","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,6]]}}}