A Heuristic Algorithm for Resource Allocation/Reallocation Problem | Zendy

S. Raja Balachandar | Zendy; K. Kannan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Heuristic Algorithm for Resource Allocation/Reallocation Problem

Author(s) -

S. Raja Balachandar,

K. Kannan

Publication year - 2011

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2011/218078

Subject(s) - knapsack problem , heuristic , benchmark (surveying) , mathematical optimization , continuous knapsack problem , null move heuristic , consistent heuristic , computer science , resource allocation , matrix (chemical analysis) , computational complexity theory , algorithm , mathematics , incremental heuristic search , beam search , search algorithm , computer network , materials science , geodesy , composite material , geography

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research