The Journal of the Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회논문지)

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

Assignment Problem Algorithm Based on the First Selection Method of the Minimum Cost

최소비용 우선선택 방법에 기반한 할당 문제 알고리즘

  • Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
  • 이상운 (강릉원주대학교 과학기술대학 멀티미디어공학과)
  • Received : 2013.03.11
  • Accepted : 2013.10.11
  • Published : 2013.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes an algorithm that seeks the optimal solution for an assignment problem through a simplified process. Generally it is Hungarian algorithm that is prevalently used to solve a given assignment problem. The proposed algorithm reduces 4 steps Hungarian algorithm into 2 steps. Firstly, the algorithm selects the minimum cost from a matrix and deletes the rest of the rows and columns. Secondly, it improves on the solution through reassignment process. For 27 balanced assignment problems and 7 unbalanced problems, the proposed algorithm has successfully yielded the optimal solution, which Genetic algorithm has failed. This algorithm is thus found to be an appropriate replacement of Hungarian algorithm.

본 논문은 할당 문제의 최적해를 간단히 찾을 수 있는 알고리즘을 제안하였다. 일반적으로 할당 문제의 최적해는 Hungarian 알고리즘으로 구한다. 제안된 알고리즘은 Hungarian 알고리즘의 4단계 수행 과정을 2단계로 단축시켰다. 첫 번째로, 행렬의 최소 비용을 선택하고 행과 열의 값을 삭제하는 과정을 거쳐 초기 할당을 수행하였다. 두 번째로 할당을 조정하는 과정을 수행하였다. 제안된 알고리즘을 27개의 균형 할당 문제와 7개의 불균형 할당 문제에 적용한 결과 Genetic 알고리즘으로 찾지 못한 최적해를 찾는데 성공하였다. 따라서 제안된 알고리즘은 Hungarian 알고리즘을 대체하여 일반적으로 적용할 수 있을 것이다.

Keywords

References

  1. Wikipedia, "Assignment Problem," http://en.wikipedia. org/wiki/Assignment_problem, Wikimedia Foundation Inc., 2013.
  2. Wikipedia, "Hungarian Algorithm," http://en.wikipedia. org/wiki/Hungarian_algorithm, Wikimedia Foundation Inc., 2013.
  3. L. Ntaimo, "Introduction to Mathematical Programming: Operations Research: Transportation and Assignment Problems", Vol. 1, 4th edition, by W. L. Winston and M. Venkataramanan, 2005.
  4. K. Kinahan and J. Pryor, "Algorithm Animations for Practical Optimization: A Gentle Introduction," http://optlab-server.sce.carleton.ca/POAnimations2007 /Default.html, 2007.
  5. D. N. Kumar, "Optimization Methods," IISc, Bangalore, 2008.
  6. Rai Foundation Colleges, "Information Research," Bachelor of Business Administration, Business Administration, 2008.
  7. S. Noble, "Lectures 15: The Assignment Problem," Department of Mathematical Sciences, Brunel University, 2000.
  8. A. Dimitrios, P. Konstantinos, S. Nikolaos, and S. Angelo, "Applications of a New Network-enabled Solver for the Assignment Problem in Computer-aided Education," Journal of Computer Science, Vol. 1, No. 1, pp. 19-23, 2005. https://doi.org/10.3844/jcssp.2005.19.23
  9. R. M. Berka, "A Tutorial on Network Optimization," http://home.eunet.cz/berka/o/English/networks/node8.html, 1997.
  10. M. S. Radhakrishnan, "AAOC C222: Optimization," Birla Institute of Technology & Science, 2006.
  11. R. Burkard, M. D. Amico, and S. Martello, "Assignment Problems, SIAM Monographs on Discrete Mathematics and Applications, 2006.
  12. S. C. Niu, "Introduction to Operations Research," School of Management, The University of Texas at Dallas, 2004.
  13. W. Snyder, "The Linear Assignment Problem," Department of Electrical and Computer Engineering, North Carolina State University, 2005.
  14. M. E. Salassi, "AGEC 7123: Operations Research Methods in Agricultural Economics: Standard LP Form of the Generalized Assignment Problem," Department of Agricultural Economics and Agribusiness, Louisiana State University, 2005.
  15. K. Wayne, "Algorithm Design," http://www.cs.princeton.edu/-wayne/kleinberg-tardos/07assignme nt.pdf, 2005.
  16. J. Havlicek, "Introduction to Management Science and Operation Research," http://orms.czu.cz/text/transproblem.html, 2007.
  17. R. Sedgewick and K. Wayne, " Computer Science 226: Data Structures and Algorithms, Princeton University, 2002.
  18. J. E. Beasley, "Operations Research and Management Science: OR-Notes," Department of Mathematical Sciences, Brunel University, West London, 2004.
  19. D. Doty, "Munkres' Assignment Algorithm: Modified for Rectangular Matrices," KCVU, Murray State University, Dept. of Computer Science and Information Systems, 2008.
  20. G. B. Dantzig, "Linear Programming and Extensions," USAF Project RAND, R-366-PR, The RAND Corporation, Santa Monica, California, U.S., 1963.
  21. M. A. Trick, "Network Optimizations for Consultants, "http://mat.gsia.cmu.edu/mstc/networks/ networks.html, 1996.
  22. Optimalon Software, "Transportation Problem (Minimal Cost)," http://www.optimalon.com/examples/transport.htm, 2008.

Cited by

  1. Interactive mosaic building and its application to marketing strategies using NFC 2017, https://doi.org/10.1007/s11042-017-5115-x
  2. Linear Bottleneck Assignment Problem Based on Reverse-delete Algorithm vol.13, pp.6, 2013, https://doi.org/10.7236/JIIBC.2013.13.6.211