计算机工程与应用2012，Vol.48Issue(11)：47-50,4.DOI:10.3778/j.issn.1002-8331.2012.11.011
求解TSP问题的改进混合蛙跳算法
Improved shuffled frog-leaping algorithm for traveling salesman problem
摘要
Abstract
According to the TSP character, an improved shuffled frog-leaping algorithm is designed. The algorithm improves the child population frog individual optimization way, not just the worst individual optimization. This way can improve the convergent speed of the algorithm effectively. In order to enhance the ability of searching, "guide optimal" probability and "guide suboptimal" probability are put forward. The "guide optimal" probability represents the global optimum solution probability that the individual reversal depends on. The "guide suboptimal" probability represents the subpopulation optimum solution probability that the individual reversal depends on. Through experiments to multiple problems of the TSPLIB, the results show that the algorithm is feasible and effective.关键词
组合优化问题/旅行商问题(TSP)/混合蛙跳算法/概率/TSPLIBKey words
combinatorial optimization problem/ Traveling Salesman Problem (TSP)/ shuffled frog-leaping algorithm/ probability/ TSPLIB分类
信息技术与安全科学引用本文复制引用
张敬敏,马丽,李媛媛..求解TSP问题的改进混合蛙跳算法[J].计算机工程与应用,2012,48(11):47-50,4.基金项目
国家自然科学基金(No.40772196) （No.40772196）
河北省科技计划项目(No.11213525D,No.09213547). （No.11213525D,No.09213547）
