Efficient anytime algorithms to solve the bi-objective Next Release Problem
نویسندگان
چکیده
منابع مشابه
An Integer Linear Programming approach to the single and bi-objective Next Release Problem
Context: The Next Release Problem involves determining the set of requirements to implement in the next release of a software project. When the problem was first formulated in 2001, Integer Linear Programming, an exact method, was found to be impractical because of large execution times. Since then, the problem has mainly been addressed by employing metaheuristic techniques. Objective: In this ...
متن کاملPareto Local Search Algorithms for Anytime Bi-objective Optimization
Pareto local search (PLS) is an extension of iterative improvement methods for multi-objective combinatorial optimization problems and an important part of several state-of-the-art multi-objective optimizers. PLS stops when all neighbors of the solutions in its solution archive are dominated. If terminated before completion, it may produce a poor approximation to the Pareto front. This paper pr...
متن کاملA Bi-Objective Approach to an Assembly Line Re-Balancing Problem: Model and Differential Evolution Algorithms
Assembly lines are special kinds of production systems which are of great importance in the industrial production of high quantity commodities. In many practical manufacturing systems, configuration of assembly lines is fixed and designing a new line may be incurred huge amount of costs and thereby it is not desirable for practitioners. When some changes related to market demand occur, it is wo...
متن کاملa bi-objective approach to an assembly line re-balancing problem: model and differential evolution algorithms
assembly lines are special kinds of production systems which are of great importance in the industrial production of high quantity commodities. in many practical manufacturing systems, configuration of assembly lines is fixed and designing a new line may be incurred huge amount of costs and thereby it is not desirable for practitioners. when some changes related to market demand occur, it is wo...
متن کاملDynamic programming algorithms for the bi-objective integer knapsack problem
This paper presents two new dynamic programming (DP) algorithms to find the exact Pareto frontier for the bi-objective integer knapsack problem. First, a property of the traditional DP algorithm for the multiobjective integer knapsack problem is identified. The first algorithm is developed by directly using the property. The second algorithm is a hybrid DP approach using the concept of the boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems and Software
سال: 2019
ISSN: 0164-1212
DOI: 10.1016/j.jss.2019.06.097