An Integer Linear Programming Model for Binary Knapsack Problem with Dependent Item Values

Mougouei, Davoud; Powers, David M. W.; Moeini, Asghar

doi:10.1007/978-3-319-63004-5_12

Cited by 14 publications

(12 citation statements)

References 20 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Precedence dependencies mainly include the requirement dependencies of type Requires (Conflicts-with), where one requirement intrinsically requires (conflicts with) another. The set of the Value Constraints (10) ensures that the minimum amounts (lower-bounds) of the expected type t values are satisfied for the selected requirements. β t in (10) denotes the required lower-bound for the expected type t value of the requirements.…”

Section: Maximizementioning

confidence: 99%

“…Regardless of the approach used for release planning, the process involves selecting an "optimal" subset of the requirements. Release planning thus is modeled as different variations of Binary Knapsack Problem (BKP), for which several mathematical formulations have been devised [9], [10]. These formulations can be solved, exactly, using advanced solvers such as IBM CPLEX [11] or be approximated using meta-heuristics [12].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Human Values in Software Release Planning

Mougouei,

Ghose,

Dam

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

Software products have become an integral part of human lives, and therefore need to account for human values such as privacy, fairness, and equality. Ignoring human values in software development leads to biases and violations of human values: racial biases in recidivism assessment and facial recognition software are well-known examples of such issues. One of the most critical steps in software development is Software Release Planning (SRP), where decisions are made about the presence or absence of the requirements (features) in the software. Such decisions are primarily guided by the economic value of the requirements, ignoring their impacts on a broader range of human values. That may result in ignoring (selecting) requirements that positively (negatively) impact human values, increasing the risk of value breaches in the software. To address this, we have proposed an Integer Programming approach to considering human values in software release planning. In this regard, an Integer Linear Programming (ILP) model has been proposed, that explicitly accounts for human values in finding an "optimal" subset of the requirements. The ILP model exploits the algebraic structure of fuzzy graphs to capture dependencies and conflicts among the values of the requirements.

show abstract

Section: Maximizementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Human Values in Software Release Planning

Mougouei,

Ghose,

Dam

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Knapsack is a decision problem by the content of achieving the maximum value in item selection but not exceeding a specific weight (knapsack's capacity), which is a Non-Polynomial (NP) complete problem [22]. On the other hand, TSP is another NP-complete problem that aims to determine a best and efficient route in a given list of m cities, while minimising the travelling cost [23].…”

Section: A Motion Planning As the Dynamic Knapsack And Travelling Sal...mentioning

confidence: 99%

UUV’s Hierarchical DE-Based Motion Planning in a Semi Dynamic Underwater Wireless Sensor Network

MahmoudZadeh

Powers

Atyabi

2019

IEEE Trans. Cybern.

Self Cite

View full text Add to dashboard Cite

This paper describes a reflexive multilayered mission planner with a mounted energy efficient local path planner for unmanned underwater vehicle's (UUV) navigation throughout complex subsea volume in a time variant semi-dynamic operation network. The UUV routing protocol in underwater wireless sensor network is generalized with a homogeneous dynamic knapsack-traveler salesman problem emerging with an adaptive path planning mechanism to address UUV's long-duration missions on dynamically changing subsea volume. The framework includes a base layer of global path planning, an inner layer of local path planning and an environmental sublayer. Such a multilayer integrated structure facilitates the framework to adopt any algorithm with real-time performance. The evolutionary technique known as differential evolution (DE) algorithm is employed by both base and inner layers to examine the performance of the framework in efficient mission timing and its resilience against the environmental disturbances. Relying on reactive nature of the framework and fast computational performance of the DE algorithm, the simulations show promising results and this new framework guarantees a safe and efficient deployment in a turbulent uncertain marine environment passing through a proper sequence of stations considering various constraint in a complex environment.

show abstract

“…Convex optimization problems are solvable (Boyd & Vandenberghe, 2004). However, for problems of moderate to large sizes, integer linear programming (ILP) models are preferred (Luenberger & Ye, 2015;Mougouei et al, 2017b) as they can be efficiently solved, despite the inherent complexity of NP-hard problems, due to the advances in solving ILP models and availability of efficient tools such as ILOG CPLEX for that purpose. This motivates us to consider developing an ILP version of the model as given by (45).…”

Section: The Integer Linear Programming Modelmentioning

confidence: 99%

Dependency-aware release planning for software projects using fuzzy graphs and integer programming

Mougouei

Powers

2019

IFS

Self Cite

View full text Add to dashboard Cite

Software requirements selection aims to find an optimal subset of the requirements with the highest value while respecting the project constraints. But the value of a requirement may depend on the presence or absence of other requirements in the optimal subset. Such Value Dependencies, however, are imprecise and hard to capture. In this paper, we propose a method based on integer programming and fuzzy graphs to account for value dependencies and their imprecision in software requirements selection. The proposed method, referred to as Dependency-Aware Software Requirements Selection (DARS), is comprised of three components: (i) an automated technique for the identification of value dependencies from user preferences, (ii) a modeling technique based on fuzzy graphs that allows for capturing the imprecision of value dependencies, and (iii) an Integer Linear Programming (ILP) model that takes into account user preferences and value dependencies identified from those preferences to reduce the risk of value loss in software projects. Our work is verified by studying a realworld software project. The results show that our proposed method reduces the value loss in software projects and is scalable to large requirement sets.

show abstract

An Integer Linear Programming Model for Binary Knapsack Problem with Dependent Item Values

Cited by 14 publications

References 20 publications

Human Values in Software Release Planning

Human Values in Software Release Planning

UUV’s Hierarchical DE-Based Motion Planning in a Semi Dynamic Underwater Wireless Sensor Network

Dependency-aware release planning for software projects using fuzzy graphs and integer programming

Contact Info

Product

Resources

About