Home > Search Results: keywords:"Travel salesman problem"
Search:
 
Search Tips :: Simple Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 3 records found  Search took 0.01 seconds. 
The Comparison of the Algorithms for the Solution of Travel Sales Problem
 Kopřiva, Jan ; Všetička, Martin (referee) ; Dostál, Petr (advisor)
The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).
Detailed record
The Comparison of the Algorithms for the Solution of Travel Sales Problem
 Kopřiva, Jan ; Všetička, Martin (referee) ; Dostál, Petr (advisor)
The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).
Detailed record
Planning a holidays in Europe with using goal programming
 Otarbayeva, Zhamilya ; Skočdopolová, Veronika (advisor) ; Kuncová, Martina (referee)
In this thesis I consider possibility to spend my vacation in one of the three countries: Spain, France, Italy. In each country I chose ten cities, which I would like to visit. I will use Travel Salesman Problem to decide the best route inside each country according to three criteria: Cost, Minutes and Transport. There is also a possibility to choose the type of transport: train or combination of train and airplane. Also I will use Weighted goal programming and Chebyshev goal programming to optimize all criteria simultaneously. In the end I will use multiple -- criteria decision analysis to compare results. According to three methods (ORESTE, ELECTRE III, TOPSIS) I will choose one of the states for my vacation. I will make all calculation in program MPL and in Excel using solver SANNA.
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