A procedure-based heuristic for 0-1 Multiple Knapsack Problems
نویسندگان
چکیده
منابع مشابه
A procedure-based heuristic for 0-1 Multiple Knapsack Problems
In this paper, we present a heuristic which derives a feasible solution for the Multiple Knapsack Problem (MKP). The proposed heuristic called RCH, is a recursive method that performs computation on the core of knapsacks. The RCH heuristic is compared with the MTHM heuristic of Martello and Toth. Computational results on randomly generated instances show that the proposed approach gives better ...
متن کاملAn Effective Repair Procedure based on Quantum-inspired Evolutionary Algorithm for 0/1 Knapsack Problems
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,...
متن کاملA Heuristic for the Multidimensional 0-1 Knapsack Problem
This paper deals with the concepts of core and core problems for multidimensional 0-1 knapsack (MKP) problems. Core problems were introduced by Balas and Zemel (1980) and have been widely studied in the literature. The core refers to the seet of variables for which it is hard to decide what their value will be in an optimal solution; and the core problem is a reduction of the original problem i...
متن کاملSolving 0-1 knapsack problems based on amoeboid organism algorithm
The 0-1 knapsack problem is an open issue in discrete optimization problems, which plays an important role in real applications. In this paper, a new bio-inspired model is proposed to solve this problem. The proposed method has three main steps. First, the 0-1 knapsack problem is converted into a directed graph by the network converting algorithm. Then, for the purpose of using the amoeboid org...
متن کاملCore problems in bi-criteria {0, 1}-knapsack problems
The most efficient algorithms for solving the single-criterion {0, 1}-knapsack problem are based on the core concept (i.e., based on a small number of relevant variables). But this concept is not used in problems with more than one criterion. The main purpose of this paper is to validate the existence of such a set of variables in bi-criteria {0.1}-knapsack instances. Numerical experiments were...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics in Operational Research
سال: 2012
ISSN: 1757-5850,1757-5869
DOI: 10.1504/ijmor.2012.046684