COMPARATIVE STUDY OF OPTIMALITY IN ASSIGNMENT PROBLEM: PROPOSED METHOD AND EXISTING METHODS
The assignment problem is a special case of the transportation problem in which the objective is to assign a number of resources to the equal number of activities at a minimum cost (or maximum profit). It is one of the main problems while assigning task to the worker. It is an important problem in mathematics and is also discuss in real physical world. In this paper we present a new proposed method for getting optimality of assignment problem. The results of new approach are compared graphically with existing approaches namely Hungarian method and Matrix Ones Assignment method (MOA method), and this approach outperforms other methods and also show the efficiency of the proposed methodology by giving some numerical examples.
Authors
- Rajeev Agrawal (ORCID: https://orcid.org/0000-0002-5415-5230)
- Priyanka Malviya
- Sushma Jain (ORCID: https://orcid.org/0000-0002-3066-2852)
- Prof. M.C. Dudey
Publication Details
- Published
- 2025-02-15
- DOI
- https://doi.org/10.51767/ic250513
- Primary Topic
- Vehicle Routing Optimization Methods
- Type
- article
- Field-Weighted Citation Impact
- 0.00