离散自由搜索算法  

Discrete free search algorithm

作　　者：郭鑫[1] 孙丽杰[1] 李光明[1] 江开忠[2] 

机构地区：[1]上海工程技术大学化学化工学院,上海201620 [2]上海工程技术大学基础教学学院,上海201620

出　　处：《计算机应用》2013年第6期1563-1565,1570,共4页journal of Computer Applications

基　　金：上海市教委学科建设专项基金资助项目(11XK11);上海工程技术大学内涵建设项目(nhky-2012-13)

摘　　要：针对离散组合优化问题,给出一个自由搜索的算法。但是仅仅通过自由搜索算法求得的解,往往存在交叉现象,针对这个问题提出将离散自由搜索算法和交叉消除相结合的算法,这样不仅大大地提高了自由搜索算法运算过程的收敛速度,而且较大程度地提升了结果的质量。利用旅行商问题(TSP)标准库中的测试数据对所提算法进行了验证,结果表明该算法比遗传算法性能提高了约1.6%。A free search algorithm was proposed for the discrete optimization problem. However, solutions simply got from free search algorithm often have crossover phenomenon. Then, an algorithm free search algorithm combined with cross elimination was put forward, which not only greatly improved the convergence rate of the search process but also enhanced the quality of the results. The experimental results using Traveling Saleman Problem （TSP） standard data show that the performance of the proposed algorithm increases by about 1.6% than that of the genetic algorithm.

关 键 词：旅行商问题 智能算法 自由搜索 交叉消除 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]