The paper deals with a comparison between two different methods in generating suboptimal solutions to the HopfieldTank TSP (traveling salesman problem) neural algorithm. Namely, the HopfieldTank 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 HopfieldTank TSP neural structure and computationally compared are: the brute force method and the fast insertion heuristic.
suggested citation:
Sanja Bauk and Nataša Kovač. "The Comparative Analysis Of Two Neural Networks." Montenegrin Journal of Economics. vol. 2, no. 3, 2006, p. 8998
BibTeX entry download
