Application of Neural Networks in Solving Travelling Salesman Problems
碩士 === 國立交通大學 === 應用數學系 === 91 === This thesis studies the uses of a transiently chaotic neural network (TCNN) as a computational method in solving the well known travelling salesman problems. The task of this omputation is to locate the minimum of an objective function, which is attained...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/08417345574020418961 |
| Summary: | 碩士 === 國立交通大學 === 應用數學系 === 91 === This thesis studies the uses of a transiently chaotic neural network (TCNN) as a computational method in solving the well known travelling salesman problems. The task of this omputation is to locate the minimum of an objective function, which is attained as the evolutions of the neural networks settle down. Properties of two objective functions adopted in previous studies are investigated. By applying the recent theory on the chaotic behaviors and convergence of iterations of the TCNN, we perform a series of numerical experiments. The experiments are also extended to the TCNN with a piecewise linear output function. It is demonstrated that such a piecewise linear output function with saturations works equally well as the strictly increasing output used in previous studies. Both successful and unsuccessful numerical examples will be illustrated. We also mention some insufficiencies of this computation method in solve combinatorial optimization problems and hope to provide further improvements.
|
|---|