摘要
以旅行商问题(TSP)为例,引入调整序思想设计了局部搜索策略,同时在全局信息交换过程中加入变异操作,提出一种改进混合蛙跳算法求解TSP问题。实验结果表明,与遗传算法和粒子群优化算法相比较,改进混合蛙跳算法在求解TSP问题上具有更好的搜索性能和顽健性。
Modified shuffled frog-leaping algorithm to solve TSP was proposed, which presented the concept of adjustment sequence to design the strategy of local searching, and added the mutation operation in the global exchange of information. Experimental results indicate that, compared with genetic algorithm and particle swarm optimization algorithm, the proposed algorithm has more powerful search capability and more strong robustness in solving TSP.
出处
《通信学报》
EI
CSCD
北大核心
2009年第7期130-135,共6页
Journal on Communications
基金
国家自然科学基金资助项目(60772148)~~
关键词
混合蛙跳算法
旅行商问题
局部搜索
全局信息交换
shuffled frog-leaping algorithm
traveling salesman problem
local search
global information exchange
