A genetic algorithm for finding a salesman’s route
Vladimir V. Kureichik, В. М. Курейчик · Journal of Computer and Systems Sciences International · 2006
The traveling salesman problem is considered. For this purpose modified methods for modeling evolution and composite search are proposed. This allows one to obtain a solution with local optimums for a polynomial time. On average, the complexity of the algorithm is quadratic.