Improving classic hungarian algorithm considering uncertainty by applying for grey numbers
The Hungarian Algorithm is the most famous method for solving Linear Assignment Problems (LAP). Linear Assignment Method (LAM), as an application of LAP, is among the most popular approaches for solving Multi Criteria Decision Making (MCDM) problems. LAM assigns a priority to each alternative based...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ayandegan Institute of Higher Education,
2023-09-01
|
| Series: | International Journal of Research in Industrial Engineering |
| Subjects: | |
| Online Access: | https://www.riejournal.com/article_181988_6cdfc5c7c424724f96988f8b39c503d4.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832577721158336512 |
|---|---|
| author | Shahram Ariafar Seyed Hamed Moosavirad Ali Soltanpour |
| author_facet | Shahram Ariafar Seyed Hamed Moosavirad Ali Soltanpour |
| author_sort | Shahram Ariafar |
| collection | DOAJ |
| description | The Hungarian Algorithm is the most famous method for solving Linear Assignment Problems (LAP). Linear Assignment Method (LAM), as an application of LAP, is among the most popular approaches for solving Multi Criteria Decision Making (MCDM) problems. LAM assigns a priority to each alternative based on a Decision Matrix (DM). The elements of the DM are often deterministic in MCDM. However, in the real world, the value of the elements of the DM might not be specified precisely. Hence, using interval grey numbers as the value of the DM to consider the uncertainty is reasonable. In this research, for providing a real circumstance, the classic Hungarian algorithm has been extended by using the concept of grey preference degree as the Grey Hungarian Algorithm (GHA) to solve LAM under uncertainty. To verify the proposed GHA, a real case for ranking several items of mining machinery warehouse from Sarcheshmeh Copper Complex has been solved by the GHA. Also, the same case study has been prioritized by two other methods: Grey TOPSIS and Grey VIKOR. The results of all mentioned approaches are identical, showing the validity of the proposed GHA developed in this research. |
| format | Article |
| id | doaj-art-1623d0e7a0994f2c8fe7717231d777c5 |
| institution | Kabale University |
| issn | 2783-1337 2717-2937 |
| language | English |
| publishDate | 2023-09-01 |
| publisher | Ayandegan Institute of Higher Education, |
| record_format | Article |
| series | International Journal of Research in Industrial Engineering |
| spelling | doaj-art-1623d0e7a0994f2c8fe7717231d777c52025-01-30T15:09:58ZengAyandegan Institute of Higher Education,International Journal of Research in Industrial Engineering2783-13372717-29372023-09-0112332133610.22105/riej.2023.345845.1344181988Improving classic hungarian algorithm considering uncertainty by applying for grey numbersShahram Ariafar0Seyed Hamed Moosavirad1Ali Soltanpour2Department of Industrial Engineering, Faculty of Engineering, Shahid Bahonar University of Kerman, Kerman, Iran.Department of Industrial Engineering, Faculty of Engineering, Shahid Bahonar University of Kerman, Kerman, Iran.Organization and Jobs Classification, National Iranian Copper Industries Company, Iran.The Hungarian Algorithm is the most famous method for solving Linear Assignment Problems (LAP). Linear Assignment Method (LAM), as an application of LAP, is among the most popular approaches for solving Multi Criteria Decision Making (MCDM) problems. LAM assigns a priority to each alternative based on a Decision Matrix (DM). The elements of the DM are often deterministic in MCDM. However, in the real world, the value of the elements of the DM might not be specified precisely. Hence, using interval grey numbers as the value of the DM to consider the uncertainty is reasonable. In this research, for providing a real circumstance, the classic Hungarian algorithm has been extended by using the concept of grey preference degree as the Grey Hungarian Algorithm (GHA) to solve LAM under uncertainty. To verify the proposed GHA, a real case for ranking several items of mining machinery warehouse from Sarcheshmeh Copper Complex has been solved by the GHA. Also, the same case study has been prioritized by two other methods: Grey TOPSIS and Grey VIKOR. The results of all mentioned approaches are identical, showing the validity of the proposed GHA developed in this research.https://www.riejournal.com/article_181988_6cdfc5c7c424724f96988f8b39c503d4.pdfgrey interval numberhungarian algorithmgrey vikorgrey topsispreference degree |
| spellingShingle | Shahram Ariafar Seyed Hamed Moosavirad Ali Soltanpour Improving classic hungarian algorithm considering uncertainty by applying for grey numbers International Journal of Research in Industrial Engineering grey interval number hungarian algorithm grey vikor grey topsis preference degree |
| title | Improving classic hungarian algorithm considering uncertainty by applying for grey numbers |
| title_full | Improving classic hungarian algorithm considering uncertainty by applying for grey numbers |
| title_fullStr | Improving classic hungarian algorithm considering uncertainty by applying for grey numbers |
| title_full_unstemmed | Improving classic hungarian algorithm considering uncertainty by applying for grey numbers |
| title_short | Improving classic hungarian algorithm considering uncertainty by applying for grey numbers |
| title_sort | improving classic hungarian algorithm considering uncertainty by applying for grey numbers |
| topic | grey interval number hungarian algorithm grey vikor grey topsis preference degree |
| url | https://www.riejournal.com/article_181988_6cdfc5c7c424724f96988f8b39c503d4.pdf |
| work_keys_str_mv | AT shahramariafar improvingclassichungarianalgorithmconsideringuncertaintybyapplyingforgreynumbers AT seyedhamedmoosavirad improvingclassichungarianalgorithmconsideringuncertaintybyapplyingforgreynumbers AT alisoltanpour improvingclassichungarianalgorithmconsideringuncertaintybyapplyingforgreynumbers |