There is one multi agent class that can be viewed as a society where the normative system guides the agents to achieve the system goals. When an agent perceives a normative system, it needs to reason about the norms impact on its desires. Considering that the agent’s resources are limited, it is necessary to reason about the resources available and if they are enough to achieve a desire or norm...

Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query range to achieve certain global optimality while avoid congesting the sensors in the meanwhile. We study this problem for a ZigBee cluster tree by formulating it into a multi-dimensional multi-choice knapsack problem. ...

In this paper, we approximately solve the multiple-choice multi-dimensional knapsack problem. We propose an algorithm which is based upon reactive local search and where an explicit check for the repetition of configurations is added to the local search. The algorithm starts by an initial solution and improved by using a fast iterative procedure. Later, both deblocking and degrading procedures ...

The multiple knapsack problem with grouped items aims to maximize rewards by assigning groups of among knapsacks, without exceeding capacities. Either all in a group are assigned or none at all. We study the bi-criteria variation problem, where capacities can be exceeded and second objective is minimize maximum capacity. propose approximation algorithms that run pseudo-polynomial time guarantee...

In this paper, we propose an optimal algorithm for the Multiple-choice Multidimensional Knapsack Problem MMKP. The main principle of the approach is twofold: (i) to generate an initial feasible solution as a starting lower bound, and (ii) at different levels of the search tree to determine an intermediate upper bound obtained by solving an auxiliary problem called MMKPaux and perform the strate...

This paper is concerned with a variation of the multiple knapsack problem (MKP) [5, 6], where we are given a set of n items N = {1, 2, . . . , n} to be packed into m possible knapsacks M = {1, 2, . . . ,m}. As in ordinary MKP, by w j and p j we denote the weight and profit of item j ∈ N respectively, and the capacity of knapsack i ∈ M is ci. However, a fixed cost fi is imposed if we use knapsac...

Test method facet is one of the factors which can have an influence on the test takers’ performance. The purpose of the current study was to investigate the effects of two different response types, multiple-choice cloze and multiple-choice test, on the pre-intermediate and intermediate test takers’ reading comprehension performance. To this end, 40 pre-intermediate and intermediate learners par...

The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard combinatorial optimization problem with a number of important applications. In this paper, we present a ”reduce and solve” heuristic approach which combines problem reduction techniques with an Integer Linear Programming (ILP) solver (CPLEX). The key ingredient of the proposed approach is a set of group fixing ...