This paper presents an evolutionary algorithm for solving the n-traveling salesman problem (N-TSP). The traveling salesman problem is an NP-Complete problem. The time required to solve the NP-Complete problem using any currently known algorithm increases very quickly as the size of the problem grows. As a result, the time required to solve even moderately large versions of many of these problems easily reaches in to the billions or trillions of years, using any amount of computing power available today. One of technique to solve NP-Complete problem it is a heuristic algorithm that works "reasonably well" in many cases but for which there is no proof that it is both always fast and always produces a good result.
Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.
Oct 15, 2021
Jul 19, 2021