Journal of Applied Mathematics

A Heuristic Algorithm for Resource Allocation/Reallocation Problem

S. Raja Balachandar and K. Kannan

Full-text: Open access


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.

Article information

J. Appl. Math., Volume 2011 (2011), Article ID 218078, 11 pages.

First available in Project Euclid: 15 March 2012

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Raja Balachandar, S.; Kannan, K. A Heuristic Algorithm for Resource Allocation/Reallocation Problem. J. Appl. Math. 2011 (2011), Article ID 218078, 11 pages. doi:10.1155/2011/218078.

Export citation