中国矿业大学信息与电气工程学院,江苏,徐州,221116
纸质出版:2011
移动端阅览
王雪松, 潘杰, 程玉虎. 基于知识迁移的Ant-Q算法[J]. 电子学报, 2011,39(10):2359-2365.
WANG Xue-song, PAN Jie, CHENG Yu-hu. Ant-Q Algorithm Based on Knowledge Transfer[J]. Acta Electronica Sinica, 2011, 39(10): 2359-2365.
常规Ant-Q算法计算复杂度随问题的规模呈现出阶乘级的增长
极大地抑制了算法的收敛速度
同时其仅关注单一任务本身
使得求出的解不具有可重用性
在处理一系列相关联任务时效率较低.为此
提出一种基于知识迁移的Ant-Q算法
通过贝叶斯理论分析源任务与目标任务的相似率
并以此为权值确定各源任务的迁移样本数
然后将各源任务样本按迁移价值降序排列
筛选出有效迁移样本
指导Agent快速做出合理决策.在att532旅行商问题上的仿真结果表明
知识迁移能够有效降低目标任务的学习难度
从而快速找到问题的最优解.
The computational complexity of traditional Ant-Q algorithm shows factorial growth with the scale of the studied problem
which greatly reduces the convergence speed.Moreover
the traditional Ant-Q algorithm only focuses on a single task
therefore
the solution for the task cannot be reusable and the algorithm will handle a series of related tasks with low efficiency.In order to improve the convergence speed
a kind of Ant-Q algorithm based on knowledge transfer is proposed.At first
the similarity between each source task and a target task is computed according to the Bayesian theory.Then the obtained similarities are viewed as the weights to determine the number of samples transferred from every source task.In the third step
the samples from source tasks are listed in a descending order according to its transfer values and some valid samples are selected.In this way
the selected samples can guide an Agent to make a rational decision quickly.Simulation results involving a traveling salesman problem att532 illustrate that the knowledge transfer technology can effectively reduce the difficulty of learning a new task and quickly find an optimal solution.
0
浏览量
1318
下载量
3
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621