Some Methods for Solving the Traveling Salesman Problem by Genetic Algorithms

Jozef Kratica
Ivana Ljubić
Vesna Šešum
Vladimir Filipović

Abstract

In this paper are described several new methods for solving traveling salesman problem (TSP) by genetic algorithms (GAs). Comparative analysis of those methods are given, with analysis of their results in practice.

Keywords: Genetic algorithms, traveling salesman problem, combinatorial optimization

Back to Jozef's Papers Home Page | Back to Jozef's Home Page