Home > Search Results: Dítětová, Tereza
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Heuristics testing for travelling salesman problem
 Dítětová, Tereza ; Jablonský, Josef (advisor) ; Fábry, Jan (referee)
The travelling salesman problem is one of the most popular kind of route trip transportation problem. This work empirically compares two chosen heuristics, giving only approximate solution in the TSP, with an optimal solution. Travelling salesman problem is easy to formulate but difficult to solve that is what makes this problem so attractive. The first chapter is focused on the theoretical definition including a historical overview, the second chapter describes selected heuristics methods for solving the TSP. The third chapter contains the results of my computing experiments that were made through an application programmed by me. The results show the nearest neighbour heuristic as more effective than the savings heuristic, both in the computation speed and the closeness to the optimum.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English