EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems

Yuxuan Zhang, Shuchang Wang iD, Wei Yang

Entropy · 06.08.2026 · 28 (8) · 886

DOI: 10.3390/e28080886 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 06.08.2026. Verfasst von Yuxuan Zhang und 2 weiteren Autor:innen. Beteiligte Einrichtung: School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 42 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science and Technology Major Project, Quantum Science and Technology—National Science and Technology Major Project.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 ϵ-constraint method. The experimental results reveal that while our methods produce fewer non-dominated solutions than ϵ-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.

Schlagwörter

Stichwörter der Autor:innen

feature selection problemmulti-objective binary optimizationnext release problemquantum annealing

Autor:innen und Institutionen

  • School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China.
  • Hefei National Laboratory, University of Science and Technology of China, Hefei 230088, China.

ORCID-Profile: Shuchang Wang

Förderung

  • National Science and Technology Major Project
  • Quantum Science and Technology—National Science and Technology Major Project

Zitieren

APA

Zhang, Y., Wang, S., & Yang, W. (2026). A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems. Entropy, 28(8), 886. https://doi.org/10.3390/e28080886

Vancouver

Zhang Y, Wang S, Yang W. A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems. Entropy. 2026;28(8):886. doi:10.3390/e28080886

BibTeX
@article{Zhang2026,
  author = {Zhang, Yuxuan and Wang, Shuchang and Yang, Wei},
  title = {A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems},
  journal = {Entropy},
  year = {2026},
  volume = {28},
  number = {8},
  pages = {886},
  doi = {10.3390/e28080886}
}
Kostenlos starten →