摘要
旅行商问题是一个经典的组合优化难题,它具有重要的理论研究价值以及实际应用意义。针对此问题提出一种基于改进选择策略的离散烟花算法,将上一代适应度值最小的火花保留,同时加入动态参数自适应调整选择数目和概率,将最优火花和动态选择火花作为子代,该选择方式兼顾了适应度大小及子代选择的优劣性,并且使算法能够跳出局部最优增强了算法的全局搜索能力,保证了种群的多样性。实验表明了改进后的算法的优化程度及可行性。
The traveling salesman problem is a classic combinatorial optimization problem,which has important theoretical research value and practical application significance.Based on this,a discrete fireworks algorithm with improved selection strategy is proposed.The main idea is to add dynamic parameters to adaptively adjust the number and probability of selection and use optimal sparks from precious generation and dynamic selection sparks as progeny.This method takes into account the degree of fitness and the quality of the offspring which also enables the algorithm to jump out of the local optimum to enhance the global search ability of the algorithm and ensure the diversity of the population.Experiments have shown the optimization and feasibility of the improved algorithm.
作者
王思琦
高尚
张宁
WANG Siqi;GAO Shang;ZHANG Ning(College of Computer Science,Jiangsu University of Science and Technology,Zhenjiang 212000)
出处
《计算机与数字工程》
2021年第10期1988-1992,共5页
Computer & Digital Engineering
关键词
离散烟花算法
选择策略
路径优化
局部最优
discrete fireworks algorithm
selection strategy
path optimization
local optimum
