Convergence of an annealing algorithm
Mathematical Programming: Series A and B
How to solve it: modern heuristics
How to solve it: modern heuristics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Multilevel Approach to the Travelling Salesman Problem
Operations Research
A Multiple Hill Climbing Approach to Software Module Clustering
ICSM '03 Proceedings of the International Conference on Software Maintenance
The Art and Science of Software Release Planning
IEEE Software
Search Based Approaches to Component Selection and Prioritization for the Next Release Problem
ICSM '06 Proceedings of the 22nd IEEE International Conference on Software Maintenance
The Current State and Future of Search Based Software Engineering
FOSE '07 2007 Future of Software Engineering
The multi-objective next release problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Bi-objective release planning for evolving software systems
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
"Fairness Analysis in Requirements Assignments
RE '08 Proceedings of the 2008 16th IEEE International Requirements Engineering Conference
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Search based data sensitivity analysis applied to requirement engineering
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Backbone guided local search for maximum satisfiability
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The backbone of the travelling salesperson
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
IEEE Transactions on Evolutionary Computation
Hi-index | 0.04 |
The next release problem (NRP) aims to effectively select software requirements in order to acquire maximum customer profits. As an NP-hard problem in software requirement engineering, NRP lacks efficient approximate algorithms for large scale instances. The backbone is a new tool for tackling large scale NP-hard problems in recent years. In this paper, we employ the backbone to design high performance approximate algorithms for large scale NRP instances. Firstly we show that it is NP-hard to obtain the backbone of NRP. Then, we illustrate by fitness landscape analysis that the backbone can be well approximated by the shared common parts of local optimal solutions. Therefore, we propose an approximate backbone based multilevel algorithm (ABMA) to solve large scale NRP instances. This algorithm iteratively explores the search spaces by multilevel reductions and refinements. Experimental results demonstrate that ABMA outperforms existing algorithms on large instances in terms of solution quality and running time.