Książka = Book ; KS/4/2009/T11P16
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
[2], 197-201 stron ; 21 cm ; Bibliografia s. 201
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.
Licencja Creative Commons Uznanie autorstwa 4.0
Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -
Instytut Badań Systemowych Polskiej Akademii Nauk
Biblioteka Instytutu Badań Systemowych PAN
Oct 15, 2021
Jul 19, 2021
28
https://rcin.org.pl./publication/234671
Pietruszka, Andrzej