This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optim...

Abstract: In this paper, the researchers have proposed a multi-dimensional knapsack model for project capital budgeting problem in uncertain situation which has been modeled through fuzzy sets. The optimistic and pessimistic situations were considered and associated deterministic models were yielded. Numerical example has been supplied toillustrate the performance of proposed model. The results...

The Three-Dimensional Knapsack Packing Problem consists of finding the maximum profit for packing a subset of boxes in a larger box (packing box). The boxes to pack are rectangular but of different sizes. This problem is a variant of the Knapsack Problem and therefore its computational complexity is NP-Complete. This article shows a parallel genetic algorithm based on the Island Model and the N...

It is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular CDMA/TDMA networks can be mapped to a Multi-dimensional Multiple-choice Knapsack Problem (MMKP) which is NP-hard. In this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. Numerical results indicate significant computational performance impr...

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 define the mathematical model of a tri-objective fuzzy agricultural food load planning problem, which is a blend of the multi-objective optimization, the multidimensional knapsack problem, and the multiple knapsack problem under fuzziness. For the imprecise model, profit and shelf life for each agricultural food product are fuzzified and represented by triangular fuzzy numbers...

The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time. On the other hand, genetic algorithms are well suited for solving the knapsack problem and they find reasonably good solutions quickly. A naturally arising question is whether genetic algorithms ar...

This paper presents a scatter search (SS) based method for the bi-criteria multi-dimensional knapsack problem. The method is organized according to the usual structure of SS: 1) diversi...cation 2) improvement 3) reference set update 4) subset generation, and 5) solution combination. Surrogate relaxation is used to convert the multi-constraint problem into a single constraint one, which is used...