Browsing by Subject "Traveling Salesman Problem"
Now showing 1 - 2 of 2
- Results Per Page
- Sort Options
Item type:Thesis, Access status: Metadata only , Modele grafowe dla wybranych zagadnień transportowych(Data obrony: 2009-11-19) Drzymała, Piotr
Wydział Matematyki StosowanejItem type:Article, Access status: Open Access , Sieci Hopfielda dla problemu komiwojażera(Wydawnictwa AGH, 2005) Klimek, MarcinIn article is described an idea Hopfield neural network for solving combinatorial optimization problems, specifically for the Traveling Salesman Problem (TSP). It was implemented three algorithms for solving TSP with Hopfield nets. The performance of these algorithms was examined in simulation study. Results of experiments are described in this work. According to these results, the conclusion is that the Hopfield nets are not applicable for solving TSP.
