Abstract：This paper firstly introduces programmes for HopfieldTSP and GeneticTSP and describes consequently the chromosome algorithm in detail, which concentrates on time complexity and effects of population size on optimized path. Comparison results and operation efficiency between the HopfieldTSP and the GeneticTSP algorithms, this paper supposes that the genetic algorithm is superior to the Hopfield neural network algorithm in solving the travelling salesman problem.
收稿日期: 2001-02-25
引用本文:
余一娇. 用Hopfield神经网络与遗传算法求解TSP问题的实验比较与分析[J]. , 2001, 40(2): 0-0.
余一娇. Hopfield neural network and genetic algorithm in solving travelling salesman problem:experimental comparison and analysis. , 2001, 40(2): 0-0.
