Analysis of Resource Allocation Problem with Different Techniques: A Comparative Study

Assigning n’s entities to m’s other entities in an invertible manner is a challenging task that arises in various circumstances. In combinatorial optimisation, assignment problems are a heavily researched area. These problems have many applications in different domains like production planning, VLSI design for telecommunications, economics, etc. The assignment problem plays a crucial role in assigning things to machines so as to reduce assignment costs. To achieve this purpose, this paper examines many ways for solving assignment problems, including Game theory, choice under uncertainty and Graph theory approaches. In order to demonstrate the efficacy of these models, the results were evaluated against one another. Throughout the study, modifications and special situations of the assignment problem and its applications are also examined. The simulation of the proposed WAP approaches is carried out using MATLAB software. The computational findings for a collection of randomly created problems of varying sizes demonstrate that the proposed methods are capable of locating solutions of high quality.