본문 바로가기
  • Home

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

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2015, 20(12), pp.75-82
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm of two-sided optimization with time complexity O(n4) . This paper suggests one-sided optimal assignment and swap optimization algorithm with time complexity O(n2) 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 k-opt (k=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.

Citation status

* References for papers published after 2023 are currently being built.