| 基于约束的离散粒子群算法求解大规模指派问题 |
| |
| 引用本文： | 王敏,李铁克.基于约束的离散粒子群算法求解大规模指派问题[J].中国会计电算化,2009(21):102-104. |
| |
| 作者姓名： | 王敏 李铁克 |
| |
| 作者单位： | 北京科技大学经济管理学院,中国北京100083 |
| |
| 摘 要： | 针对现有进化算法在求解传统指派问题时因取整而影响优化效果的问题，采用了一种基于AllDifferent约束的置换离散粒子群优化算法，该算法针对指派问题中各变量不能重复取值的特点，改进了算法的迭代方式，并引入了模拟退火的差解接受准则以提高优化效果，仿真算例表明改进后的算法在质量上和时间上更具有效性。
|
| 关 键 词： | 指派问题 粒子群优化算法 混合算法 大规模 |
Solving Large-scale Assignment Problem by Constraint-based Discrete Particle Swarm Optimization |
| |
| Authors: | WANG Min LI Tie-ke |
| |
| Institution: | (School of Economics and Management, University of Science and Technology Beijing-Beijing 100083,China) |
| |
| Abstract: | According to the limited optimization effect of the existing evolutionary algorithms on solving the traditional assignment problems, a method of replacement discrete particle swarm optimization based on AllDifferent constraint is adopted. The algorithm is aimed at the variable features of non-repeated in the assignment problems with an improved iterated mode, and in addition the worse-solution-acceptance criteria of simulated annealing algorithm is introduced to improve the optimal results. Numerical experiments show the feasibility of the improved algorithm for large-scale assignment problems. |
| |
| Keywords: | Assignment Problem Particle Swarm Optimization Hybrid Algorithm Large--scale |
| 本文献已被 维普 等数据库收录！ |
