The orienteering problem is one of the newer problems in the field of discrete programming. The formulation of this problem originates from a sport discipline, called orienteering. In the beginning of this thesis a formulation and mathematical model for this problem are introduced. The extension of the problem is the team orienteering problem, described in the next chapters of theoretical part. Many heuristics were published for this problem. While the heuristic of Chao et al. and a path relinking approach are described in detail in this thesis. Practical part deals with the team orienteering problem applied to a real task, specifically a visiting of 23 attractions in the New York in different number of days. The solution is found by optimization program Lingo 90 and by heuristic of Chao el al. Heuristic algorithm was implemented in programming language Visual Basic for Application. A comparison of the results is described at the end of the practical part.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:193513 |
| Date | January 2014 |
| Creators | Chocholáček, Ján |
| Contributors | Pelikán, Jan, Fábry, Jan |
| Publisher | Vysoká škola ekonomická v Praze |
| Source Sets | Czech ETDs |
| Language | Slovak |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0022 seconds