New greedy heuristics for the Multiple-choice Multi-dimensional Knapsack Problem
by Chaitr S. Hiremath, Raymond R. Hill
International Journal of Operational Research (IJOR), Vol. 2, No. 4, 2007

Abstract: This paper examines the Multiple-choice Multi-dimensional Knapsack Problem (MMKP) – a more complex variant of the classic knapsack problem (KP). We survey existing algorithms for the variants of the KP and critically examine existing test problems for the MMKP. We present an empirical study of sample legacy solution approaches compared to two new systematically-developed greedy heuristics for the MMKP. We extend our testing to include a new systematically-generated test problem set. Characteristics of all the problem sets are compared and used to explain the empirical performance results obtained and demonstrate the superiority of our greedy heuristic approach.

Online publication date: Sun, 24-Jun-2007

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 Operational Research (IJOR):
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