Visualization of metaheuristics for the travelling salesman problem

Описание к видео Visualization of metaheuristics for the travelling salesman problem

The video depicts four metaheuristic algorithms applied to the travelling salesman problem: local search, tabu search, simulated annealing and a genetic algorithm. The problem instance is PCB442 from the TSPLib. The experiments were performed using Ascension framework: http://inversed.ru/Ascension.htm

Support me on Patreon:   / inversed  

Комментарии

Информация по комментариям в разработке