一种TSP的新算法:智能邻近点算法  

A New Algorithm of TSP: Intelligent Proximal Point Algorithm

作　　者：周昇[1] 

机构地区：[1]南通职业大学机械工程学院,江苏南通226007

出　　处：《南通职业大学学报》2017年第3期72-76,81,共6页Journal of Nantong Vocational University

基　　金：2014年教育部计算机辅助技术教育系列课题(CAXC-13A-54)

摘　　要：针对旅行商问题(TSP),创建了一种新算法-智能邻近点算法,其主要策略是:按照概率在临近城市里选取下一造访城市,使得那些最短整体路径中出现次数多的局部路径的再次被选概率越来越大。运行结果表明,此算法能有效减少运算规模,所编MATLAB程序语言简洁,易读,可方便快捷地计算31个所选城市最优或较优的巡回路径。Aiming at the traveling salesman problem, a new algorithm, intelligent neighbor point algorithm, is proposed. The main strategies are as follows： Select the next city in the neighborhood according to the proba-bility, so the probability of increasing the number of local paths that appear more frequently in the shortest overall path is increased. This algorithm can effectively reduce the size of the operation, and with the simple, easy to read MATLAB programming language, the optimal tour route of the 31 main cities in China could be achieved conveniently.

关 键 词：旅行商问题 邻近点法 MATLAB 智能 算法 概率 

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