Efficient heuristic for very large 0/1 multiple knapsack problems
by Yacine Laalaoui; Hedi Mhalla
International Journal of Computational Systems Engineering (IJCSYSE), Vol. 2, No. 2, 2015

Abstract: In this paper, we describe a heuristic that solves very large problem instances (one million items) of the 0/1 multiple knapsack problem. The proposed method is based on IRT heuristic and it is a pure local search technique that attempts to improve within a subset of items instead of the complete set of n items. Each time an interval of items is randomly selected to choose the set of items that can increase the total profit. The experimental work reveals an excellent scalability to solve very large problem instances against IRT and Martelo&Toth heuristic method (MTHM).

Online publication date: Mon, 20-Jun-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Systems Engineering (IJCSYSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com