A One to One Assignment Optimization Problems and its Evolutionary Algorithm

This paper introduces a One to One assignment optimization model.Then a novel evolutionary algorithm for assignment problems(AP for short) is proposed based on the model.Heuristics mutation operator and local search scheme are designed in the algorithm.The algorithm converges to the global optimal solution with probability one.Finally,the simulation is made and the results show the effectiveness of the proposed algorithm.