A Precedence Constrained Knapsack Problem with Uncertain Item Weights for Personalized Learning Systems

Aslan, Ayşe; Ursavas, Evrim; Romeijnders, Ward

doi:10.1016/j.omega.2022.102779

Cited by 4 publications

(2 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, according to some farmers' needs, precedence constraints are imposed, i.e., several chains of plants must be considered (Nancel-Penard, et al, 2022). However, the objective is to maximize the profit of land investment with the consideration of precedence constraints (Aslan, et al, 2023). This problem is a variant of the agricultural land investment problem (ALIP) presented by Saleh (Saleh, 2018) with the variant, where precedence constraints have been presented and imposed on pairs of items.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Iterative Three-Stage Neighborhood Search for Solving Precedence Constrained Agricultural Land Investment Problem

Sarhan,

Saleh

2023

JMCIE

View full text Add to dashboard Cite

The use of neighborhood search techniques to address a practical issue faced by agricultural investors is examined in this study. The problem is named as agricultural land investment problem with precedence constraints and it has an essential impact on agriculture issues. The tackled problem can be viewed as a variant of the well-known classical 0-1 knapsack problem where precedence constraints are imposed on pairs of items. Precedence constraints take into account a precedence relation between items. This paper first simulates the considered problem as precedence constraints knapsack problem and presents a mathematical representation model. Then, an iterative three-stage neighborhood search method is proposed for optimizing the problem. The proposed method consists of three stages. First stage applies a greedy procedure in order to construct a feasible solution. Second stage applies local search procedures in order to enhance the quality of the solutions at hand. Third and last, in order to broaden the search space, a random neighborhood destruction approach is introduced. Finally, the effectiveness of the suggested approach is assessed and contrasted with the outcomes obtained by greedy and local search techniques. The presented method is competitive and efficient since it produces excellent solutions in a reasonable amount of time.

show abstract

Section: Introductionmentioning

confidence: 99%

“…From the mathematical representation of the PCALIP, we can observe that the solution domain of a 0-1 knapsack problem can be characterized by Equation (2) and Equation (4). By adding, Equation (3), the problem is changed and becomes another variant of the classical 0-1 knapsack problem, known as the precedence-constrained knapsack problem.…”

Section: Introductionmentioning

confidence: 99%