Bachelor thesis defence (Štefan Brest)
Date: 28 january 2009
Work:
Š. Brest. Reševanje problema nesimetričnega trgovskega potnika z diferencialno evolucijo in hevrističnimi algoritmi: diplomska naloga univerzitetnega študijskega programa. Fakulteta za elektrotehniko, računalništvo in informatiko, 2009.
Abstract
The presented diploma work begins with the history and development of evolutionary algorithms and differential evolution. Heuristic algorithms are described as basis for the asymmetric traveling salesman problem solving.
The main part of the diploma work is designing and implementation of DEATSP algorithms, where we try to solve asymmetric salesman problem with differential evolution. These involve various combinations of heuristic algorithms and our aim is to search for the one that gives the best solution to the given traveling salesman problem.
Finally, the results acchieved with DEATSP algorithms on standard TSPLIB library data for the salesman problem are presented. The work is concluded with the summary of the best combination of differential evolution and heuristic algorithms for the given problem.
