控制理论与应用2016，Vol.33Issue(10)：1378-1388,11.DOI:10.7641/CTA.2016.50982
一种求解企业员工指派问题的离散状态转移算法
A novel discrete state transition algorithm for staff assignment problem
摘要
Abstract
The staff assignment problem is a kind of integer programming problem in operations research. In order to find the optimal staff assignment scheme with minimal total cost, this paper proposes a novel discrete state transition algo-rithm and puts forward the concept of second transition on the basis of first transition, which is helpful to expand the range of candidate solutions and improve the diversity of the candidates. To overcome the shortcomings of slow convergence of the algorithm at a later stage, stagnation backtracking strategy is proposed;that is to say, when the algorithm is stagnated into local minima, the backtracking operation is performed, and the current optimal solution is randomly selected from previously stagnant solutions. Finally, the experiments are verified and compared with the simulated annealing algorithm to prove the validity of these two strategies. Simulation results have showed the effectiveness of the improved method . Meanwhile, the method can improve the success rate and stability for this problem.关键词
指派问题/离散状态转移算法/二次状态转移/停滞回溯/整数规划Key words
assignment problem/discrete state transition algorithm/second transition/stagnation backtracking/integer programming分类
信息技术与安全科学引用本文复制引用
董天雪,阳春华,周晓君,桂卫华..一种求解企业员工指派问题的离散状态转移算法[J].控制理论与应用,2016,33(10):1378-1388,11.基金项目
国家自然科学基金项目(61533021,61503416),中南大学创新驱动计划项目(2015cx007),探索项目(7131253)资助 （61533021,61503416）
