The Comparative Analysis Of Two Neural Networks

Sanja Bauk and Natasa Kovac

Montenegrin Journal of Economics, 2006, vol. 2, issue 3, 89-98

Abstract: 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.

Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://repec.mnje.com/mje/2006/v02-n03/mje_2006_v02-n03-a12.pdf (application/pdf)
http://repec.mnje.com/mje/2006/v02-n03/mje_2006_v02-n03-a12.html (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:mje:mjejnl:v:2:y:2006:i:3:p:89-98

Access Statistics for this article

Montenegrin Journal of Economics is currently edited by Veselin Draskovic

More articles in Montenegrin Journal of Economics from Economic Laboratory for Transition Research (ELIT)
Bibliographic data for series maintained by Nikola Draskovic Jelcic ().