A hybrid algorithm for the assignment problem
Hongbing Xu, Houjun Wang, Chunguang Li · 2003
In this paper, a hybrid algorithm for solving the assignment problem is proposed. The proposed algorithm consists of two phases: a neural network method is used in the first phase to find a local minimum point, and the second phase implements the dynamic tunneling technique to escape from the local minimum. The repeated application of these two phases results in a global minimum point. The computer simulation results demonstrate the efficiency of the proposed algorithm.