Siirry suoraan sisältöön
Metaheuristics for Hard Optimization
Tallenna

Metaheuristics for Hard Optimization

The first part is devoted to the detailed presentation of the four most widely known metaheuristics:

• the simulated annealing method,

• tabu search,

• the evolutionary algorithms,

• ant colony algorithms.

Each one of these metaheuristics is actually a family of methods, of which the essential elements are discussed.

Alaotsikko
Methods and Case Studies
Kääntäjä
A. Chatterjee
Painos
Softcover reprint of hardcover 1st ed. 2006
ISBN
9783642061943
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
12.2.2010
Sivumäärä
372