基于优良模式连接的分布估计算法求解TSP问题

摘要
图/表
参考文献
相关文章 (1)

全文: PDF (535 KB) HTML (1 KB)
输出: BibTeX | EndNote (RIS)

摘要提出一种新的基于优良模式连接的分布估计算法求解TSP问题．首先构造两两相邻的模式矩阵，然后结合优良个体信息建立多个相邻模式的连接块．以块为整体调整排列顺序，避免重复搜索，改善优良模式构造块的破坏问题,提高搜索速度．同时对每个块内部的模式有条件地进行局部调整，进一步加强算法的局部搜索能力．仿真结果表明，本文算法在求解TSP问题时表现出较好的性能．

	服务

	把本文推荐给朋友
	加入我的书架
	加入引用管理器
	E-mail Alert
	RSS
	作者相关文章
	何小娟
	曾建潮

关键词 ：分布估计算法, 优良模式连接, 模式矩阵, TSP问题

Abstract：An Estimation of Distribution Algorithm for TSP problems based on superiority pattern junction is proposed. The pairwise adjacent pattern matrix is constructed, then the junction blocks are built combining with superiority individual information. Each block is adjusted as a whole to avoid repeating search. Therefore, the disruption of superiority building blocks is solved and the search speed is improved. At the same time, the patterns within each block is made local adjustment under special conditions to enhance the local search ability. The simulation results show that the proposed algorithm has better efficiency in solving the TSP problems.

Key words： Estimation of Distribution Algorithms Superiority Pattern Junction Pattern Matrix TSP Problems

引用本文:

何小娟, 曾建潮. 基于优良模式连接的分布估计算法求解TSP问题[J]. 模式识别与人工智能, 2011, 24(2): 185-193. HE Xiao-Juan, ZENG Jian-Chao. Solving TSP Problems with Estimation of Distribution Algorithm based on Superiority Pattern Junction. , 2011, 24(2): 185-193.

链接本文:

http://manu46.magtech.com.cn/Jweb_prai/CN/ 或 http://manu46.magtech.com.cn/Jweb_prai/CN/Y2011/V24/I2/185