An incomplete m‐exchange algorithm for solving the large‐scale multi‐scenario knapsack problem

An incomplete m‐exchange algorithm for solving the large‐scale multi‐scenario knapsack problem

0.00 Avg rating0 Votes
Article ID: iaor20121261
Volume: 39
Issue: 9
Start Page Number: 1988
End Page Number: 2000
Publication Date: Sep 2012
Journal: Computers and Operations Research
Authors: , , ,
Keywords: programming: integer, heuristics
Abstract:

This paper introduces a fast heuristic based algorithm for the max–min multi‐scenario knapsack problem. The problem is a variation of the standard 0–1 knapsack problem, in which the profits of the items vary under different scenarios, though the capacity of the knapsack is fixed. The objective of the problem is to find the optimal packing of a set of items so that the minimum total profits of the items in the knapsack over all different scenarios is maximized. For some large‐scaled instances, traditional branch‐and‐bound techniques cannot find an optimal solution within reasonable time, thus we propose a collection of incomplete m‐exchange algorithms which are able to produce high quality solutions in just a few minutes of cpu time. Various computational results are also given.

Reviews

Required fields are marked *. Your email address will not be published.