Clarification of decisions of "the traveling salesman problem" of the genetic mutations

Бесплатный доступ

The analysis of results of numerical solution of the classical problem of a salesman. Identified reasons for the inaccuracy of the results obtained. The paper presents an algorithm of the genetic mutations to clarify the decisions of the traveling salesman problem, obtained by numerical methods.

Traveling salesman problem, greedy algorithm, genetic algorithm, mutation

Короткий адрес: https://sciup.org/14729856

IDR: 14729856

Статья научная