Modeling ship's route by the adaptation of Hopfield-Tank TSP neural algorithm

Resumen

This paper considers determining the optimal linear ship´s route by the application of the Hopfield-Tank neural network algorithm adaptation for solving well known traveling salesman problem (TSP). In the paper proposed mathematical approach to the Hopfield-Tank TSP neural algorithm realization is primarily based upon faster generating zero-one matrices of suboptimal solutions.