SOLVING THE ASSIGNMENT PROBLEM VIA THE ABSOLUTE DIFFERENCE CALCULATION ALGORITHM
Main Article Content
Abstract
The assignment problem is a fundamental combinatorial optimization challenge with applications across industries, where resources must be assigned to tasks in a cost-efficient manner. Traditional approaches, such as the Hungarian algorithm, minimize assignment costs by reducing the matrix to an optimal form. This study introduces an alternative approach using an "absolute difference calculation" algorithm, in which each element’s difference from the minimum or maximum in its row is evaluated and adjusted iteratively to ensure feasible solutions and finally MATLAB program is used to solve example.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
References
Khalid, M., Sultana, M., & Zaidi, F. (2014). New improved Ones assignment method. Applied Mathematical Sciences, 8, 4171–4177. https://doi.org/10.12988/ams.2014.45327
Munapo, E. (2020). Development of an accelerating hungarian method for assignment
problems. Eastern-European Journal of Enterprise Technologies, 4(4 (106)), 6–13.
https://doi.org/10.15587/1729-4061.2020.209172
Vasko, F. J., Reigle, C., & Landquist, E. (2018). A final note on the ones assignment method and its variants: they do not work. International Journal of Industrial and Systems
Engineering, 29(3), 405. https://doi.org/10.1504/ijise.2018.10013962
Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1-2), 83-97.
Munkres, J. (1957). Algorithms for the assignment problem. Journal of the Society for
Industrial and Applied Mathematics, 5(1), 32-38.
Agharghor, A., & Riffi, M. E. (2016). First Adaptation of Hunting Search Algorithm for the
Quadratic Assignment Problem (pp. 263–267). springer nature. https://doi.org/10.1007/978-3- 319-46568-5_27