Metaheuristics for Hard Optimization

Johann Dréo

ISBN 10: 354023022X / ISBN 13: 9783540230229

Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2005, 2005

Riguardo questo articolo

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.

Codice articolo 9783540230229

Dati bibliografici

• Titolo: Metaheuristics for Hard Optimization
• Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2005
• Data di pubblicazione: 2005
• Lingua: Inglese
• ISBN 10: 354023022X
• ISBN 13: 9783540230229
• Rilegatura: Buch
• Condizione: Neu

Descrizione articolo

Riassunto

Contains case studies from engineering and operations research

Includes commented literature for each chapter

Dalla quarta di copertina

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.