A two-stage hybrid method for the multi-scenarios max-min knapsack problem
by Thekra Aldouri; Mhand Hifi
International Journal of Intelligent Engineering Informatics (IJIEI), Vol. 6, No. 1/2, 2018

Abstract: In this paper, we propose a two-stage hybrid method in order to solve approximately the multi-scenarios max-min knapsack problem. The proposed method is based upon three complementary stages: 1) the building stage; 2) the combination stage; 3) the two-stage rebuild stage. First, the building stage serves to provide a starting feasible solution by using a greedy procedure; each item is randomly chosen for reaching a starting population of solutions. Second, the combination stage tries to provide each new solution by combining subsets of (starting) solutions. Third, the rebuild stage tries to make intensification in order to improve the solutions at hand. The proposed method is evaluated on a set of benchmark instances taken from the literature. The obtained results are compared to those reached by the best algorithms available in the literature. The results show that the proposed method provides better solutions than those already published.

Online publication date: Fri, 06-Apr-2018

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 Intelligent Engineering Informatics (IJIEI):
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