Open Access
Translator Disclaimer
2011 A Heuristic Algorithm for Resource Allocation/Reallocation Problem
S. Raja Balachandar, K. Kannan
J. Appl. Math. 2011: 1-11 (2011). DOI: 10.1155/2011/218078


This paper presents a 1-opt heuristic approach to solve resource allocation/reallocation problem which is known as 0/1 multichoice multidimensional knapsack problem (MMKP). The intercept matrix of the constraints is employed to find optimal or near-optimal solution of the MMKP. This heuristic approach is tested for 33 benchmark problems taken from OR library of sizes upto 7000, and the results have been compared with optimum solutions. Computational complexity is proved to be O ( k l m n 2 ) of solving heuristically MMKP using this approach. The performance of our heuristic is compared with the best state-of-art heuristic algorithms with respect to the quality of the solutions found. The encouraging results especially for relatively large-size test problems indicate that this heuristic approach can successfully be used for finding good solutions for highly constrained NP-hard problems.


Download Citation

S. Raja Balachandar. K. Kannan. "A Heuristic Algorithm for Resource Allocation/Reallocation Problem." J. Appl. Math. 2011 1 - 11, 2011.


Published: 2011
First available in Project Euclid: 15 March 2012

zbMATH: 1236.90149
MathSciNet: MR2846442
Digital Object Identifier: 10.1155/2011/218078

Rights: Copyright © 2011 Hindawi


Vol.2011 • 2011
Back to Top