A distributed heuristic solution using arbitration for the MMMKP

Authors:
Md. Mostofa Akbar;Eric. G. Manning;Gholamali C. Shoja;Steven Shelford;Tareque Hossain
Affiliations:
BUET, Dhaka, Bangladesh;PANDA Group, UVic, Victoria, BC, Canada;PANDA Group, UVic, Victoria, BC, Canada;UVic, Victoria, BC, Canada;Commlink Info Tech Ltd., R&D Group, Dhaka, Bangladesh
Venue:
AusPDC '10 Proceedings of the Eighth Australasian Symposium on Parallel and Distributed Computing - Volume 107
Year:
2010

Citing 3
Cited 0

A computational study of a multiple-choice knapsack algorithm

ACM Transactions on Mathematical Software (TOMS)
Heuristic Solutions for the Multiple-Choice Multi-dimension Knapsack Problem

ICCS '01 Proceedings of the International Conference on Computational Science-Part II
A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Multiple-Choice Multi-Dimension Multi Knapsack Problem (MMMKP) is the distributed version of Multiple-Choice Multi-Dimension Knapsack Problem (MMKP), a variant of the 0--1 classic Knapsack Problem. Algorithms for finding the exact solution of MMKP as well as MMMKP are not suitable for application in real time decision-making applications. This paper presents a new heuristic algorithm, Arbitrated Heuristic (A-HEU) for solving MMMKP. A-HEU finds the solution with a few messages at the cost of reduced optimality than that of I-HEU, which is a centralized algorithm. We also discuss practical uses of MMMKP such as distributed Video on Demand service.