Open Access Theses and Dissertations

Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

You searched for subject:(n stroj). One record found.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Brno University of Technology

1. Kopřiva, Jan. Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/4355 

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). Advisors/Committee Members: Dostál, Petr (advisor), Všetička, Martin (referee).

Subjects/Keywords: Problém obchodního cestujícího; Turingův stroj; časová a prostorová složitost problému; polynomialní složitost; deterministický a nedeterministický algoritmus; orientovaný a neorientovaný graf; software MATLAB; P-těžké problémy; N-těžké problémy; NP-úplné problémy; algoritmus Hill climbing; algoritmus Tabu search; alogritmus Exhause search; algoritmus Random search; algoritmus Greedy; algoritmus Backtracking; algoritmus Simultal anheling; algoritmus Genetic search; algoritmus Ant Colony; algoritmus Particle swarms; Travel salesman problem; Turing machine; time and space complexity; polynomial time; deterministic and nondeterministic algorithm; directed and undirected graph; software MATLAB; P-hard; N-hard; NP-complete problem; alogrithm Hill climbing; algorithm Tabu search; algorithm Exhause search; algorithm Random search; algoritm Greedy; algorithm Backtracking; algorithm Simultal anheling; Genetic algorithm; algorithm Ant Colony algorithm; algoritm Particle swarms

Record Details  Similar Records    Google PlusoneFacebookTwitterCiteULikeMendeleyreddit

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kopřiva, J. (2019). Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/4355

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kopřiva, Jan. “Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem.” 2019. Thesis, Brno University of Technology. Accessed April 12, 2021. http://hdl.handle.net/11012/4355.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kopřiva, Jan. “Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem.” 2019. Web. 12 Apr 2021.

Vancouver:

Kopřiva J. Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Apr 12]. Available from: http://hdl.handle.net/11012/4355.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kopřiva J. Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/4355

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.