Critical analysis of hopfield's neural network model for tsp and its comparison with heuristic algorithm for shortest path computation
Loading...
Date
2012
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Abstract
For shortest path computation,
Travelling-Salesman problem is NP-complete and is
among the intensively studied optimization problems.
Hopfield and Tank's proposed neural network based
approach, for solving TSP, is discussed. Since original
Hopfield's model suffers from some limitations as the
number of cities increase, some modifications are
discussed for better performance. With the increase in
the number of cities, the best solutions provided by
original Hopfield's neural network were considered to
be far away from those provided by Lin and
Kernighan using Heuristic algorithm. Results of both
approaches are compared for different number of
cities and are analyzed properly
Description
Keywords
Electrical Engineering, Applied Sciences, Travelling-Salesman Problem
Citation
Proceedings of 9th International Bhurban Conference on Applied Sciences & Technology (IBCAST) Islamabad, Pakistan, 9th - 12th January, 2012