二阶蚁群算法及蛙跳算法的研究-计算机系统结构专业论文.docxVIP

考虑到蚁群算法有较强的耦合性，研究了二阶蚁群算法与蛙跳算法的 融合。一是将二阶蚁群算法的概率选择规则中加入了经验反馈算子，使得 蚂蚁在路径构建中能够考虑所选取解元素对整个路径的长期影响；二是设 计了双态蚁群搜索模式，把蚂蚁分成常规蚂蚁和寻优蚂蚁两种状态，避免 了蚂蚁选取较长的路径；三是使用改进的交叉算子和变异算子来改进混合 蛙跳算法的局部搜索过程，使得蛙跳算法最大程度的避免了不成熟的收敛。 最后，在二阶蚁群算法的每一步迭代过程中引入蛙跳算法的局部搜索与全 局更新过程。实验表明，本文算法在求解旅行商问题精度上有很大提高。 关键词：二阶蚁群算法；蛙跳算法；硬化分策略；软化分策略； 经验反馈算子； STUDY ON DOUBLE PHASE ANT COLONY OPTIMIZATION AND SHUFFLED FROG LEAPING ALGORITHM Abstract Ant Colony Optimization (ACO) is a group intelligent optimization algorithms inspired by nature ant foraging behavior. ACO algorithm for solving the problem of discrete optimization mechanism to solve a lot of problems in science and engineering fields: for example, a variety of classic combinatorial optimization problem, the problem of digital image processing and so on. Despite the positive feedback ant colony algorithm has a pheromone update strategy , greedy heuristic search mechanisms can ensure finding better solutions faster , but when the search process of ant colony algorithm to the late , all the ants explore solutions exactly the same ,there is no solution space for further development. As the ant colony algorithm coupled with a strong, easy and other heuristics and bionic optimization algorithm combining, paper selected shuffled frog leaping algorithm (SFLA) integration with ant colony algorithm, so the algorithm running late jump out of local optimal solution, increasing the accuracy of the algorithm to solve . the main content of this paper is the following: First, we propose double phase ant colony optimization (DPACO). In order to introduce pheromone update phase ant colony algorithm update rules , a two-stage ant pheromone on the path traversed updated, we propose two pheromone update phase partitioning strategy: hard partitioning strategy, soft partitioning strategy, Furthermore, the value of the pheromone on each path is limited to an integer interval; Trough testing on the classic traveling salesman problem, results show that the improved algorithm can jump out o