Subtitle:

Książka = Book ; KS/4/2009/T11P16

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Description:

[2], 197-201 pages ; 21 cm ; Bibliography p. 201

Type of object:

Book/Chapter

Abstract:

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.

Relation:

Książka = Book

Detailed Resource Type:

Book

Resource Identifier:

oai:rcin.org.pl:198348

Source:

KS-2009-04-T11P16

Language:

pol

Language of abstract:

pol

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

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.

Access:

Open