论文部分内容阅读
帝国竞争算法是一种已在连续优化问题上取得较好效果的新型社会政治算法.为了使该算法更好地应用于离散型组合优化问题,提出一种求解旅行商问题的新型帝国竞争算法.在传统算法的基础上,改变初始帝国的生成方式;同化过程采取替换重建方式,以提升求解质量;革命过程中引入自适应变异算子,以增强搜索能力;殖民竞争过程中调整了殖民地分配方式;算法加入帝国增强过程,以加快寻化速度.实验结果表明,新型帝国竞争算法求解质量高、收敛速度快.
Empire competition algorithm is a new type of social-political algorithm that has achieved good results on continuous optimization problems.In order to make the algorithm better applied to discrete combinatorial optimization problems, a new empire competition algorithm for solving traveling salesman problem is proposed. On the basis of the traditional algorithm, the generation mode of the initial empire is changed; the replacement reconstruction method is adopted in the assimilation process to improve the quality of solution; the adaptive mutation operator is introduced in the process of revolution to enhance the search ability; the colonial distribution mode is adjusted during the process of colonial competition The algorithm added empire to enhance the process to speed up the search speed.The experimental results show that the new empire competition algorithm has the advantages of high quality and fast convergence.