Skip to main content

Login for students

Login for employees

Publication detail

Possibilities of solving Travelling salesman problem with different metaheuristic methods
Authors: Míča Ondřej
Year: 2015
Type of publication: ostatní - přednáška nebo poster
Page from-to: nestránkováno
Titles:
Language Name Abstract Keywords
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