|
Dòng
|
Nội dung
|
|
1
|
Ant colonies for the traveling salesman problem / Marco Dorigo, Luca Maria Gambardella // TR/IRIDIA/1996-3. - Belgium. - . - ISSN:
Ký hiệu phân loại (DDC): 004
We describe an artificial ant colony capable of solving the traveling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to both symmetric and asymmetric instances of the TSP. The method is an example, like simulated annealing, neural networks, and evolutionary computation, of the successful use of a natural metaphor to design an optimization algorithm.
Số bản sách:
(0)
Tài liệu số:
(1)
|
|
2
|
Combinatorial optimization : algorithms and complexity / Christos H Papadimitriou; Kenneth Steiglitz
Mineola, N.Y. : Dover Publications, 1998
496 p. : illustrations ; 22 cm.
Ký hiệu phân loại (DDC): 511.6
A text for a range of graduate courses, with some of the material suitable for students of computer science with a background in the theory of algorithms and some suitable for those with a background in operations research. Corrected and unabridged from the 1982 publication by Prentice-Hall, with a new preface. Annotation copyrighted by Book News, Inc., Portland, OR.
Số bản sách:
(1)
Tài liệu số:
(0)
|
|
3
|
Genetic algorithms in search, optimization, and machine learning / David E. Goldberg
Mass. : Addison-Wesley, Reading, 1989
xiii, 412 pages. : illustrations
Ký hiệu phân loại (DDC): 006.31
This text introduces the theory, operation, and application of genetic algorithms- search algorithms based on the mechanics of natural selection and genetics. Although genetic algorithms are already considered to be an important methodology in the development of search and machine-learning methods, only recently have they received attention in other research and industrial circles
Số bản sách:
(1)
Tài liệu số:
(0)
|
|
4
|
|
|
5
|
|
|
|
|
|