We consider the problem of assigning software processes (or tasks) to hardware processors in distributed robotics environments. We introduce the notion of a task variant, which supports the adaptation of software to specific hardware configurations. Task variants facilitate the trade-off of functional quality versus the requisite capacity and type of target execution processors. We formalise th...

Abst rac t . The d-dimensional orthogonal knapsack problem (OKP) has a wide range of practical applications, including packing, cutting, and scheduling. We present a new approach to this problem, using a graphtheoretical characterization of feasible packings. This characterization allows us to deal with classes of packings that share a certain combinatorical structure, instead of single ones. C...

Multi-objective optimisation is regarded as one of the most promising ways for dealing with constrained optimisation problems in evolutionary optimisation. This paper presents a theoretical investigation of a multi-objective optimisation evolutionary algorithm for solving the 0-1 knapsack problem. Two initialisation methods are considered in the algorithm: local search initialisation and greedy...

Motivated by a food promotion problem, we introduce the Knapsack Problem for Perishable Items (KPPI) to address a dynamic problem of optimally filling a knapsack with items that disappear randomly. The KPPI naturally bridges the gap and elucidates the relation between the pspace-hard restless bandit problem and the np-hard knapsack problem. Our main result is a problem decomposition method resu...

We are interested in the role of restricted mating schemes in the context of evolutionary multi-objective algorithms. In this paper, we propose an adaptive assortative mating scheme that uses similarity in the decision space (genotypic assortative mating) and adapts the mating pressure as the search progresses. We show that this mechanism improves the performance of the simple evolutionary algo...

Emergence of chip multiprocessor systems has dramatically increased the performance potential of computer systems. Since the amount of exploited parallelism is directly influenced by the selection of the algorithm, algorithmic choice also plays a critical role in achieving high performance on modern architectures. Hence, in the era of multicore computing, it is important to re-evaluate algorith...

Ralph Gomory has recently aroused interest in a special type of knapsack problem in which the constraint coefficients and constant term are elements of a finite additive group. The significance of this problem lies in the fact that it is closely related to the general integer linear programming problem, resulting by removing the nonnegativity restrictions on those variables in the general probl...

In this paper, we present an approach, based on dynamic programming, for solving the 0-1 multi-objective knapsack problem. The main idea of the approach relies on the use of several complementary dominance relations to discard partial solutions that cannot lead to new non-dominated criterion vectors. This way, we obtain an efficient method that outperforms the existing methods both in terms of ...

Abstract. We apply the replica analysis established by Gardner to the multiconstraint continuous knapsack problem, which is one of the linear programming problems and a most fundamental problem in the field of operations research (OR). For a large problem size, we analyse the space of solution and its volume, and estimate the optimal number of items to go into the knapsack as a function of the ...

The goal of QoS-aware service composition is to generate optimal composite services that satisfy QoS requirements defined by clients. However, when compositions contain multiple execution paths, it is difficult to generate a solution that simultaneously optimizes all the execution paths involved in the composition at the same time, while meets global QoS constraints imposed by clients. Furtherm...