Publikace detail

Possibilities of solving Travelling salesman problem with different metaheuristic methods

Autoři: Míča Ondřej

Rok: 2015

Druh publikace: ostatní - přednáška nebo poster

Strana od-do: nestránkováno

Tituly:

Jazyk	Název	Abstrakt	Klíčová slova
eng	Possibilities of solving Travelling salesman problem with different metaheuristic methods	The Travelling salesman problem id a NP-hard problem, therefore it is almost impossible to solve this problem with exact methods at real time. So the travelling salesman problem is nowadays usually solved with heuristic or metaheuristic methods. In this poster are shown the basic metaheuristic methods - tabu search, simulated annealing and ant colony optimization method - and these methods are compared to each other by solving several cases of travelling salesman problem.	Travelling salesman problem; Metaheuristic; Optimization

Vyhledávání