Comparative study of maximisation assignment model by existing method and newly proposed methods

Agnivesh Tiwari, Kabir Chaudhary, Rahul Boadh and Yogendra Kumar Rajoria

International Journal of Operational Research, 2024, vol. 51, issue 4, 469-490

Abstract: One of the simplest uses of linear programming is known as the assignment problem, which is a special case of the transportation problem. The assignment problem manages the inquiry about to dole out n-items to m-different items in the most ideal way for production planning, telecommunication, VLSI design, economics, etc. Many researchers developed newly proposed methods for solving assignment problems and others modified the Hungarian method. Therefore, in the present study, an effort has been made to solve the real-life balance and unbalance type profit maximisation assignment problem used by ten newly proposed methods such as MAP, MSEI, ATOC, NAZs and six others methods, and compared results with Hungarian method. This study found that Method 8 takes the least time for computation of both type problems as compared with other methods. This paper advocates that new researchers and scientists may use the newly proposed Method 8 in place of the existing method.

Keywords: assignment problem; Hungarian method; optimal solution; profit maximisation. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=143341 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijores:v:51:y:2024:i:4:p:469-490

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().