摘要
研究优化求解多路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.
出处
《华东船舶工业学院学报》
2003年第4期42-46,共5页
Journal of East China Shipbuilding Institute(Natural Science Edition)