Abstract

The classical methods have limited scope in practical applications as some of them involve objective functions which are not continuous and/or differentiable. Evolutionary Computation is a subfield of artificial intelligence that involves combinatorial optimization problems. Travelling Salesperson Problem (TSP), which considered being a classic example for Combinatorial Optimization problem. It is said to be NP-Complete problem that cannot be solved conventionally particularly when number of cities increase. So Evolutionary techniques is the feasible solution to such problem. This paper explores an evolutionary technique: Geometric Hopfield Neural Network model to solve Travelling Salesperson Problem. Paper also achieves the results of Geometric TSP and compares the result with one of the existing widely used nature inspired heuristic approach Ant Colony Optimization Algorithms (ACA/ACO) to solve Travelling Salesperson Problem.

Keyword

Hopfield Neural Networks, Combinatorial Optimization Problem, Geometric –TSP, Ant Colony Algorithm - ACA.

Cite this article

.A Comparative Study of Geometric Hopfield Network and Ant Colony Algorithm to Solve Travelling Salesperson Problem. International Journal of Advanced Computer Research. 2014;4(16):843-848.

Refference