A Heuristic Algorithm for Resource Allocation/Reallocation Problem

S. Raja Balachandar and K. Kannan

Journal of Applied Mathematics, 2011, vol. 2011, issue 1

Abstract: 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(klmn2) 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.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2011/218078

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2011:y:2011:i:1:n:218078

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().