摘要
针对非洲野狗算法求解优化问题时全局性收敛不强的特点，对该算法进行改进，提出了改进的非洲野狗算法，结合二进制编码设计了求解离散优化问题的二进制编码非洲野狗算法，并将该算法应用于求解TSP问题并与其他算法做对比分析。研究结果显示，求解TSP问题时二进制编码非洲野狗算法求解精度更高，收敛速度更快。
For the African wild dog algorithm to solve the optimization problem when the global convergence is not strong, the algorithm is improved, an improved African wild dog algorithm is proposed, and a binary coded African wild dog algorithm for solving discrete optimization problems is designed in combination with the binary code. The algorithm is applied to solve the TSP problem and compared with other algorithms. The research results show that the binary coded African wild dog algorithm has higher accuracy and faster convergence speed when solving the TSP problem.
作者
赵建强
缪张晓
郭家良
王从志
陈必科
ZHAO Jian-qiang;MIAO Zhang-xiao;GUO Jia-liang;WANG Cong-zhi;CHEN Bi-ke(School of Mathematic and Physical Science,Xuzhou University of Technology,Xuzhou 221111,China;Department of Mathematics,Southeast University,Nanjing 210096,China;Nanjing University of Science and Technology,School of Computer Science and Engineering,Nanjing 210094 China)
出处
《数学的实践与认识》
北大核心
2018年第22期304-312,共9页
Mathematics in Practice and Theory
基金
国家自然科学基金青年项目(11701286)
江苏省博士后基金(1601076)
关键词
非洲野狗算法
二进制编码非洲野狗算法
TSP
离散优化问题
african wild dog algorithm
binary code african wild dog algorithm
TSP
discreteoptimization problem
