Three Tabu Search algorithms are presented for the 0-1 multi-dimensional multi-objective knapsack problem. Experiments are carried out to study the role of different diversification techniques for TS and to compare TS with well-known evolutionary algorithms.

We examine a situation in which a decision-maker executes a sequence of resource allocation decisions over time, but the availability of the indivisible resources at future epochs is uncertain due to actions of competitors. We cast this problem as a specialized type of stochastic knapsack problem in which the uncertainty of item (resource) availability is induced by competitors concurrently fil...

We study a 0-1 knapsack problem, in which the objective value is forbidden to take some values. We call gaps related forbidden intervals. The problem is NP-hard and pseudopolynomially solvable independently on the measure of gaps. If the gaps are large, then the problem is polynomially non-approximable. A non-trivial special case with respect to the approximate solution appears when the gaps ar...

Abstract We consider a bilevel continuous knapsack problem where the leader controls capacity of knapsack, while follower chooses feasible packing maximizing his own profit. The leader’s aim is to optimize linear objective function in and follower’s solution, but with respect different item values. address stochastic version this profits are uncertain from perspective, only probability distribu...

We tackle the thief orienteering problem (ThOP), an academic multi-component that combines two classical combinatorial problems, namely Knapsack Problem and Orienteering Problem. In ThOP, a has time limit to steal items distributed in given set of cities. While traveling, collects by storing them their knapsack, which turn reduces travel speed. The as objective maximize total profit stolen item...

The 0/1 knapsack problem is a well-known problem, which appears in many real domains with practical importance. The problem is NP-complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. Many algorithms have been proposed in the past five decades for both single and multiobjective knapsack problems. A new versi...