Online Version - Last Updated - 20 Jan 2012 |
 |
| Home |
| |
| Procedures and Resources for Authors |
|
| Information and Resources for Volume Editors |
| |
| Orders and Subscriptions |
| |
| Published Articles |
|
| Upcoming Volumes |
| |
| Contact Us |
| |
| Useful External Links |
| |
| CRPIT Site Search |
A Distributed Heuristic Solution using Arbitration for the MMMKP
Akbar, M. M., Manning, E. G., Shoja, G. C., Shelford, S. and Hossain, T.
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.
Cite as: Akbar, M. M., Manning, E. G., Shoja, G. C., Shelford, S. and Hossain, T. (2010). A Distributed Heuristic Solution using Arbitration for the MMMKP. In Proc. Eighth Australasian Symposium on Parallel and Distributed Computing (AusPDC 2010) Brisbane, Australia. CRPIT, 107. Chen, J. and Ranjan, R. Eds., ACS. 31-39
(from crpit.com)
(local if available)
