Neural network is the representation of brain's learning approach. This brain operates as multiprocessor and has excellent interlinked. Neural Network also can be represented as \"Parallel distributed processing\" planning. Travelling Salesman's Problem (TSP) is a classical example of optimization and constrain satisfaction problem which falls under the family of NP-complete of problems. The authors have discussed an implementation of an algorithm in neural network for an approximate solution for Travelling Salesman's Problem. They have used continuous hopfield network to find the solution for the given problem. The algorithm gives near optimal result in most of the cases for up to 100 cities.