| 自适应变异的离散粒子群算法研究 |
| |
| 引用本文： | 张元清,包骏杰,卫茜. 自适应变异的离散粒子群算法研究[J]. 重庆三峡学院学报, 2007, 23(3): 27-30 |
| |
| 作者姓名： | 张元清 包骏杰 卫茜 |
| |
| 作者单位： | 1. 重庆教育学院计算机与现代教育技术系,重庆,400067
2. 重庆大学外国语学院,重庆,400044 |
| |
| 摘 要： | 针对算法易早熟和收敛慢的缺点,提出了一种新的自适应变异离散粒子群算法。算法中的变异思想是一种确定性交异操作,能使算法中陷入局部极小区域的粒子通过变异行为进行全局寻优,从而克服算法易早熟的缺陷。
|
| 关 键 词： | 离散粒子群算法 自适应变异 TSP在问题 |
| 文章编号： | 1009-8135（2007）03-0027-04 |
| 修稿时间： | 2007-02-21 |
A Study on the Particle Swarm with Adaptive Mutation |
| |
| ZHANG Yuan-qing,BAO Jun-jie,Wei Qian. A Study on the Particle Swarm with Adaptive Mutation[J]. JOurnal of Chongqing Three Gorges University, 2007, 23(3): 27-30 |
| |
| Authors: | ZHANG Yuan-qing BAO Jun-jie Wei Qian |
| |
| Affiliation: | 1. Department of Computer and Modem Education Technology, Chongqing Education College, Chongqing 400067; 2. College of Foreign Langwages; Chongqing University, Chongqing |
| |
| Abstract: | To overcome the weakness that the arithmetic at present is prone to premature and is slow to convergence,a completely new way is found out,that is, SAMDPSO. The idea of this arithmetic is a definite modulating operation, which enables the particles trapped in local tiny field to search for optimization roundly through modulation. Thus, disadvantage of prematudty in computing was overcome. |
| |
| Keywords: | DPSO TSP question SA |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
