The Comparative Analysis Of Two Neural Networks

The paper deals with a comparison between two different methods in generating sub-optimal solutions to the Hopfield-Tank TSP (traveling salesman problem) neural algorithm. Namely, the Hopfield-Tank TSP neural algorithm has been applied in the paper to the linear ship's route, that is cycle voyage modeling, which means here finding the optimal visiting order of a given set of ports in such way as to minimize the total sailing distance and implicitly total linear ship's traveling costs. The methods being implemented here into Hopfield-Tank TSP neural structure and computationally compared are: the brute force method and the fast insertion heuristic.