One-Sided Optimal Assignment and Swap Algorithm for Two-Sided Optimization of Assignment Problem

Title & Authors
One-Sided Optimal Assignment and Swap Algorithm for Two-Sided Optimization of Assignment Problem
Lee, Sang-Un;

Abstract
Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm of two-sided optimization with time complexity $\small{O(n^4)}$. This paper suggests one-sided optimal assignment and swap optimization algorithm with time complexity $\small{O(n^2)}$ can be achieve the goal of two-sided optimization. This algorithm selects the minimum cost for each row, and reassigns over-assigned to under-assigned cell. Next, that verifies the existence of swap optimization candidates, and swap optimizes with $\small{{\kappa}-opt({\kappa}=2,3)}$. For 27 experimental data, the swap-optimization performs only 22% of data, and 78% of data can be get the two-sided optimal result through one-sided optimal result. Also, that can be improves on the solution of best known solution for partial problems.
Keywords
Hungarian Algorithm;Minimum Cost;One-sided Optimization;Reassignment;Swap;
Language
Korean
Cited by
References
1.
E. Budish and E. Cantillon, "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, Vol. 102, No. 5, pp. 2237-2271, Aug. 2012.

2.
H. W. Kuhn, "50 Years of Integer Programming 1958-2008, Chapter 2. The Hungarian Method for the Assignment Problem," Springer-Verlag Berlin Heidelberg, pp. 29-47, 2010.

3.
L. Ntaimo, "Introduction to Mathematical Programming: Operations Research: Transportation and Assignment Problems," 4th ed., by W. L. Winston and M. Venkataramanan, 2005.

4.
K. Kinahan and J. Pryor, "Algorithm Animations for Practical Optimization: A Gentle Introduction," Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada, 2007.

5.
D. N. Kumar, "Optimization Methods," http://www.nptel.iitm.ac.in/ourses/Webcourse-contents/IISc-BANG/OPTIMIZATION METHODS/pdf/Optimization_Methods_Syllabus.pdf, IISc, Bangalore, 2008.

6.
x-ray-TopCoder "Assignment Problem and Hungarian Algorithm," https://www.topcoder.com/community/data-science/data-science-tutorials/assignment-problem-and-hungarian-algorithm/, Topcoder, 2014.

7.
S. Singh, "Note on Assignment Algorithm with Easy Method of Drawing Lines to Cover All Zeros," International Journal of Operations Research and Information Systems, Vol. 3, No. 3, pp. 87-97, Jul. 2012.

8.
S. U. Lee, "An Assignment Problem Algorithm Using Minimum Cost Moving Method," Journal of KSCI, Vol. 20, No. 8, pp. 105-112, Aug. 2015.

9.

10.
S. Noble, "Lectures 15: The Assignment Problem," Department of Mathematical Sciences, Brunel University, 2000.

11.
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, Jan. 2005.

12.
R. M. Berka, "A Tutorial on Network Optimization," http://www.berkovi.cz/milan/berka/o/English/networks/networks.html, 1997.

13.
M. S. Radhakrishnan, "AAOC C222: Optimization," Birla Institute of Technology & Science, 2006.

14.
R. Burkard, M. D. Amico, and S. Martello, "Assignment Problems, SIAM Monographs on Discrete Mathematics and Applications, 2006.

15.
S. C. Niu, "Introduction to Operations Research," School of Management, The University of Texas at Dallas, 2004.

16.
W. Snyder, "The Linear Assignment Problem," Department of Electrical and Computer Engineering, North Carolina State University, 2005.

17.
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.

18.
K. Wayne, "Algorithm Design," http://www.cs.princeton.edu/-wayne/kleinberg-tardos/07assignment.pdf, 2005.

19.
J. Havlicek, "Introduction to Management Science and Operation Research," http://orms.czu.cz/text/transproblem.html, 2007.

20.
R. Sedgewick and K. Wayne, "Computer Science 226: Data Structures and Algorithms, Princeton University, 2002.

21.
J. E. Beasley, "Operations Research and Management Science: OR-Notes," Department of Mathematical Sciences, Brunel University, West London, 2004.

22.
D. Doty, "Munkres' Assignment Algorithm: Modified for Rectangular Matrices," KCVU, Murray State University, Dept. of Computer Science and Information Systems, 2008.

23.
G. B. Dantzig, "Linear Programming and Extensions," USAF Project RAND, R-366-PR, The RAND Corporation, Santa Monica, California, U.S., 1963.