摘要
提出一种基于优良模式连接的分布估计算法求解TSP问题.首先构造两两相邻的模式矩阵,然后结合优良个体信息建立多个相邻模式的连接块.以块为整体调整排列顺序,避免重复搜索,改善优良模式构造块的破坏问题,提高搜索速度.同时对每个块内部的模式有条件地进行局部调整,进一步加强算法的局部搜索能力.仿真结果表明,本文算法在求解TSP问题时表现出较好的性能.
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. Meanwhile, 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.
出处
《模式识别与人工智能》
EI
CSCD
北大核心
2011年第2期185-193,共9页
Pattern Recognition and Artificial Intelligence
关键词
分布估计算法
优良模式连接
模式矩阵
TSP问题
Estimation of Distribution Algorithm, Problem Superiority Pattern Junction, Pattern Matrix, TSP