In this paper we study and solve two different variants of static knapsack problems with random weights: The stochastic knapsack problem with simple recourse as well as the stochastic knapsack problem with probabilistic constraint. Special interest is given to the corresponding continuous problems and three different problem solving methods are presented. The resolution of the continuous proble...

Although there are a variety of heuristics developed and applied to the variants of the binary knapsack problem, the testing of these heuristics are based on poorly defined test problems. This paper reviews the various types of knapsack problems, considers how test problems have been generated and depicts via empirical results the implications of using poorly formed test problems for empirical ...

A new repair method based on QEA for 0/1 knapsack problems is proposed. In this approach, the qubit chromosome is used as heuristic knowledge to evaluate each element for the knapsack. The main idea is to delete the knapsack elements in the ascending order of qubit chromosome’s probability value whilst avoid violating the constraints on its capacity. To minimize the influence of initialization,...

The multidimensional knapsack problem is defined as an optimization problem that is NP-hard combinatorial. The multidimensional knapsack problems have large applications, which include many applicable problems from different area, like cargo loading, cutting stock, bin-packing, financial and other management, etc. This paper reviews some researches published in the literature. The concentrate i...

We consider a stochastic version of the 0–1 Knapsack Problem in which, addition to profit and weight, each item is associated with probability exploding destroying all contents knapsack. The objective maximise expected selected items. resulting problem, denoted as Time-Bomb (01-TB-KP), has applications logistics cloud computing scheduling. introduce nonlinear mathematical formulation study its ...

An instance of the multiperiod binary knapsack problem (MPBKP) is given by a horizon length T, non-decreasing vector sizes $$(c_1, \ldots , c_T)$$ where $$c_t$$ denotes cumulative size for periods $$1,\ldots ,t$$ and list n items. Each item triple (r, q, d) r reward or value item, q its size, d time index (or, deadline). The goal to choose, each deadline t, which items include maximize total re...