%0 Journal Article
	%A Mhand Hifi and  Hedi Mhalla and  Mustapha Michaphy
	%D 2010
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 47, 2010
	%T The Multi-scenario Knapsack Problem: An Adaptive Search Algorithm
	%U https://publications.waset.org/pdf/11073
	%V 47
	%X In this paper, we study the multi-scenario knapsack problem, a variant of the well-known NP-Hard single knapsack problem. We investigate the use of an adaptive algorithm for solving heuristically the problem. The used method combines two complementary phases: a size reduction phase and a dynamic 2- opt procedure one. First, the reduction phase applies a polynomial reduction strategy; that is used for reducing the size problem. Second, the adaptive search procedure is applied in order to attain a feasible solution Finally, the performances of two versions of the proposed algorithm are evaluated on a set of randomly generated instances.

	%P 1772 - 1775