本文已被：浏览 1183次 下载 1968次
Received:May 21, 2015 Revised:June 23, 2015
Received:May 21, 2015 Revised:June 23, 2015
中文摘要: 针对已有算法搜索时间较长,且易于过早地收敛于非最优解的缺陷,利用粒子群优化算法给出了圆排列问题的求解方法.首先,在分析了圆排列问题与旅行商问题关系的基础上,将圆排列问题转化为旅行商问题,从而得到一个相应的组合优化问题.然后,利用粒子群优化算法进行了求解.接着,为了进一步提高算法的精度,文中给出了一种利用混合粒子群优化算法的方案.最后,在仿真实验中,与已有算法进行了比较,实验结果表明,文中所给方法是有效的.
Abstract:In view of the existing algorithms are of long searching time and easily to prematurely converge to the optimal solution, this paper proposes a method for solving circle permutation problem using particle swarm optimization algorithm. First of all, based on the analyzing of relationship between circular permutation problem and the traveling salesman problem, circular permutation problem is translated into traveling salesman problem and accordingly, a corresponding combinatorial optimization problem is obtained. Then, the problem is solved by particle swarm optimization algorithm. Thirdly, in order to further improve the precision of the algorithm, this paper proposes a scheme based on a hybrid particle swarm optimization algorithm. Finally, in the simulation experiments, compared with the existing algorithm, the simulation results show that the proposed method is effective.
keywords: circle permutation problem combinatorial optimization particle swarm optimization algorithm evolutionary algorithm
文章编号： 中图分类号： 文献标志码：
基金项目:国家自然科学基金(61273127);陕西省自然科学基础研究计划(2014JM8325);陕西省教育厅科研计划(14JK1538)
引用文本：
徐小平,朱秋秋,邰会强.利用粒子群优化算法求解圆排列问题.计算机系统应用,2016,25(2):152-156
XU Xiao-Ping,ZHU Qiu-Qiu,TAI Hui-Qiang.Solving Circle Permutation Problem by Particle Swarm Optimization Algorithm.COMPUTER SYSTEMS APPLICATIONS,2016,25(2):152-156
徐小平,朱秋秋,邰会强.利用粒子群优化算法求解圆排列问题.计算机系统应用,2016,25(2):152-156
XU Xiao-Ping,ZHU Qiu-Qiu,TAI Hui-Qiang.Solving Circle Permutation Problem by Particle Swarm Optimization Algorithm.COMPUTER SYSTEMS APPLICATIONS,2016,25(2):152-156
