基于退火策略的混沌神经网络在解KTSP问题中的应用  

Applying Chaotic Neural Network Based on Annealing Strategy to KTSP Problem

作　　者：翁妙凤[1] 李文瑜[1] 

机构地区：[1]华东船舶工业学院电子与信息系,江苏镇江212003

出　　处：《华东船舶工业学院学报》2003年第4期42-46,共5页Journal of East China Shipbuilding Institute(Natural Science Edition)

摘　　要：研究优化求解多路TSP问题(KTSP)。首先求出将KTSP转化成TSP的换位矩阵,然后用基于退火策略的混沌神经网络(ACNN)模型求解KTSP。仿真结果表明算法是有效的。An optimal method to solve the multiple travelling salesmen problem(KTSP) is proposed.Firstly the relation matrix changing KTSP into TSP is got,then applying chaotic neural network based on annealing strategy(ACNN) solves KTSP.The experimental results demonstrate the effectiveness of the algorithms.

关 键 词：退火策略 混沌神经网络 KTSP 

分 类 号：O221[理学—运筹学与控制论]