A Comparative Study for Finding the Cost of
Assignment Problem using Hungarian Method
and Genetic Algorithm of Artificial
Intelligence

Rajendra Prasad; Samiullah

doi:https://doi.org/10.14445/22315373/IJMTT-V60P534

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 60 | Number 4 | Year 2018 | Article Id. IJMTT-V60P534 | DOI : https://doi.org/10.14445/22315373/IJMTT-V60P534

A Comparative Study for Finding the Cost of Assignment Problem using Hungarian Method and Genetic Algorithm of Artificial Intelligence

Rajendra Prasad, Samiullah

Abstract

From the general description, the use of Genetic Algorithm in the Assignment Problem as compared to Hungarian Method is shorter and more efficient.

Keywords

Artificial Intelligence, Assignment Problem, Genetic Algorithm, Hungarian Method, Operation Research.

References

[1] Fredric S. Hillier, “Introduction to Mathematical Programming.”, Stanford Univ. Mac Graw-hill Inc. (1995).
[2] Goldbery D. E., “Optimization and Machine Learning.”, Genetic Algorithm in Search (1989).
[3] Addison – Wesley, Mitchell, “An Introduction to Genetic Algorithm.” Press (1996).
[4] Patricia D. Novac, “Dorland’s Pocket Medical Dictionary.” W. B. Saunders Company.
[5] Thomas Dean. James Allen, “Artificial Intelligence Theory and Practice.” The Benjamin/ Cumming Publishing Company Inc. Redwood City, California 94665 (1965)
[6] Wayne, L. Winston, “Operation Research. Application and Algorithm.” Indiana University, California 94065, Duxbury Press, Boston (1987)

Citation :

Rajendra Prasad, Samiullah, "A Comparative Study for Finding the Cost of Assignment Problem using Hungarian Method and Genetic Algorithm of Artificial Intelligence," International Journal of Mathematics Trends and Technology (IJMTT), vol. 60, no. 4, pp. 220-224, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V60P534