An Improved Algorithm for TSP Problem Solving with Hopfield Neural Networks

Jin Liang An; Jia Gao; Jin Hui Lei; Guo Hong Gao

doi:10.4028/www.scientific.net/AMR.143-144.538

Paper Titles

Composition Identification of Typical Decorative Textiles in Tibetan Historical Buildings by Burning Test and Projection Microscope Test
p.515

Realtime Measurement of Temperature Field during Direct Laser Deposition Shaping
p.521

A Novel Empirical Mode Decomposition Denoising Scheme
p.527

Perceptually Optimized UDP-Lite Protocol for 3D Model Streaming among Lossy Network
p.533

An Improved Algorithm for TSP Problem Solving with Hopfield Neural Networks
p.538

Design of the Thermoelectric Generator
p.543

Immune-Inspired Quantum Genetic Optimization Algorithm and its Application
p.547

A Novel Heuristic Routing Algorithm for Peer-to-Peer Network
p.552

Enterprise Search Services and Application of Security Database System
p.557

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 143-144An Improved Algorithm for TSP Problem Solving with...

An Improved Algorithm for TSP Problem Solving with Hopfield Neural Networks

Abstract:

Hopfield and Tank have shown that neural networks can be used to solve certain computationally hard problems, in particular they studied the Traveling Salesman Problem (TSP). In this paper,on the base of the analysis of tradiontial methord,introduced an improved algorithm for TSP Problem Solving with Hopfield Neural Networks.We found the accuracy of the results depend on the initial parameters to a large extent, discussed how to set initial parameters properly; analysed the internal relationship between the terms in energy function, and improved the energy function. Used a fixed starting point to eliminate the equivalent solution problem,and the number of neurons is reduced from the N2 to (N-1)2. The improved algorithm reduced the unnecessary equivalent solution in calculate process, enhanced the computational efficiency. Experiment results showed that the algorithm improved the speed and the convergence.

You might also be interested in these eBooks

Smart Materials and Intelligent Systems, SMIS2010

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 143-144)

Pages:

538-542

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.143-144.538

Citation:

Cite this paper

Online since:

October 2010

Authors:

Jin Liang An, Jia Gao, Jin Hui Lei, Guo Hong Gao

Keywords:

Algorithm (GA), Hopfield, Improved, TSP

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Hopfleld JJ, Tank DW Neural, computation of decision in optimization problems. Biol Cybern 52: 141~152.

Google Scholar

[2] ZHANG Yu yan, CHEN Ping. The Parameters Analysis in Using Hopfield NN to Solve the TSP. Microelectronics and Computer. 2003，5: 8~10.

Google Scholar

[3] Aiyer S.V.B., M. Niranjan, and F. Fallside, A theoretical investigation into the performance of the Hopfield model, IEEE Transactions on Neural Networks, 1990. vol. 1, p.204～215.

DOI: 10.1109/72.80232

Google Scholar

[4] S. Lin B.W. Kernighan, An Effective Heuristic Algorithm for The Traveling Salesman Problem. Operational Research，1973(21)18～19.

DOI: 10.1287/opre.21.2.498

Google Scholar

[5] Liu Haitao, The Research and Applications of Artificial Neural Network in the Traveling Salesman Problem. North University of China. (2009).

Google Scholar