改进的Tabu Machine网络求解最大割问题  

IMPROVED MAXIMUM CUT PROBLEM SOLUTION WITH TABU MACHINE NETWORK

作　　者：刘建军[1] 

机构地区：[1]德州学院计算机系,山东德州253023

出　　处：《计算机应用与软件》2011年第8期169-172,共4页Computer Applications and Software

基　　金：山东省教育厅科研发展计划项目(J08LJ54)

摘　　要：为了提高Tabu Machine网络处理最大割问题时解的质量,改进原有算法的禁忌搜索策略,并且通过结合局部搜索策略和分布估计策略,形成一种新的网络HNNTS-EDA。此网络有较强的局部搜索能力和脱离局部最优值的能力。将HNNTS-EDA网络与多种经典算法在相同测试数据上进行对比测试,实验结果表明HNNTS-EDA网络具有更强的寻优能力。In order to improve the solution quality of maximum cut problem processed with Tabu Machine Network,by improving the tabu search strategy of previous algorithm and combining local search strategy with estimation of distribution strategy,a new network,which is called HNNTS-EDA for short,is created.This network has preferably stronger local search ability and the capacity of getting out of the local optimum value.By comparing the HNNTS-EDA network with a number of classic algorithms on testing the same data,it is proved that it possesses stronger search ability.

关 键 词：Tabu MACHINE 网络 自适应禁忌搜索 分布估计策略 最大割问题 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]