Using new DPSO algorithm to solve assignment problem
一种新的离散粒子群算法在指派问题中的应用

Assignment problem is a NP-Complete problem in the field of combinatorial optimization. This paper proposed a discrete particle swarm algorithm to solve the problem. In the algorithm the location of each particle represented a feasible plan. The cross strategy and local search technology were adopted when updating the particle positions. These techniques could ensure the solution feasible in the iterative process, increase the diversity of particles and avoid premature during optimization. The simulation examples show that the DPSO algorithm is simple, and it can give better solution than other algorithms with fast convergence. The algorithm is able to solve the problem which the Hungary algorithm cannot do. For different issues it can achieve good convergence effects through adjusting the impact parameters.