Metaheuristics for Hard Optimization

Johann Dréo

ISBN 10: 354023022X / ISBN 13: 9783540230229

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2005, 2005

About this Item

Neuware -Metaheuristics for Hard Optimization comprises of three parts. 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. In the second part, the book presents some other less widespread metaheuristics, then, extensions of metaheuristics and some ways of research are described . The problem of the choice of a metaheuristic is posed and solution methods are discussed. The last part concentrates on three case studies from telecommunications, air traffic control, and vehicle routing.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 384 pp. Englisch.

Seller Inventory # 9783540230229

Bibliographic Details

• Title: Metaheuristics for Hard Optimization
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2005
• Publication Date: 2005
• Language: English
• ISBN 10: 354023022X
• ISBN 13: 9783540230229
• Binding: Buch
• Condition: Neu
• Dimensions: 241W x 160H x 27D millimeters 241 millimeters width by 160 millimeters height by 27 millimeters depth
• Weight: 740 grams

About this title

Synopsis

Metaheuristics for Hard Optimization comprises of three parts. 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. In the second part, the book presents some other less widespread metaheuristics, then, extensions of metaheuristics and some ways of research are described . The problem of the choice of a metaheuristic is posed and solution methods are discussed. The last part concentrates on three case studies from telecommunications, air traffic control, and vehicle routing.