Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2011 (2011), Article ID 218078, 11 pages
Research Article

A Heuristic Algorithm for Resource Allocation/Reallocation Problem

Department of Mathematics, School of Humanities & Sciences, SASTRA University, Tamil Nadu, Thanjavur 613401, India

Received 3 February 2011; Revised 16 June 2011; Accepted 19 July 2011

Academic Editor: Yuri Sotskov

Copyright © 2011 S. Raja Balachandar and K. Kannan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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 𝑂 ( 𝑘 𝑙 𝑚 𝑛 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.