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
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
2-Exchange, multi-scenario, knapsack problem
1988-2000
Song, X.
ff20e46a-8d2b-4540-9ca2-834f047a1e8d
Lewis, R.
6f1ba3ae-babd-4e0e-9fc4-7dee2e4d57af
Thompson, J.
14ccc740-5992-40d3-8120-61ad47a8d17e
Wu, Y.
e279101b-b392-45c4-b894-187e2ded6a5c
September 2012
Song, X.
ff20e46a-8d2b-4540-9ca2-834f047a1e8d
Lewis, R.
6f1ba3ae-babd-4e0e-9fc4-7dee2e4d57af
Thompson, J.
14ccc740-5992-40d3-8120-61ad47a8d17e
Wu, Y.
e279101b-b392-45c4-b894-187e2ded6a5c
Song, X., Lewis, R., Thompson, J. and Wu, Y.
(2012)
An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem.
Computers and Operations Research, 39 (9), .
(doi:10.1016/j.cor.2011.09.012).
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
This record has no associated files available for download.
More information
e-pub ahead of print date: 29 September 2011
Published date: September 2012
Keywords:
2-Exchange, multi-scenario, knapsack problem
Organisations:
Centre of Excellence for International Banking, Finance & Accounting
Identifiers
Local EPrints ID: 336442
URI: http://eprints.soton.ac.uk/id/eprint/336442
ISSN: 0305-0548
PURE UUID: 23a7b9ab-f215-43d9-883a-09ec911aed47
Catalogue record
Date deposited: 26 Mar 2012 15:38
Last modified: 15 Mar 2024 03:20
Export record
Altmetrics
Contributors
Author:
X. Song
Author:
R. Lewis
Author:
J. Thompson
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
