Metaheuristics for Hard Optimization: Methods and Case Studies
Autor Johann Dréo Traducere de A. Chatterjee Autor Alain Pétrowski, Patrick Siarry, Eric Taillarden Limba Engleză Paperback – 12 feb 2010
• 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.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 378.37 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 12 feb 2010 | 378.37 lei 6-8 săpt. | |
Hardback (1) | 384.66 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 24 noi 2005 | 384.66 lei 6-8 săpt. |
Preț: 378.37 lei
Nou
Puncte Express: 568
Preț estimativ în valută:
72.42€ • 76.39$ • 60.35£
72.42€ • 76.39$ • 60.35£
Carte tipărită la comandă
Livrare economică 03-17 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642061943
ISBN-10: 364206194X
Pagini: 384
Ilustrații: XII, 372 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:Softcover reprint of hardcover 1st ed. 2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 364206194X
Pagini: 384
Ilustrații: XII, 372 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:Softcover reprint of hardcover 1st ed. 2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Presentation of the Main Metaheuristics.- Simulated Annealing.- Tabu Search.- Evolutionary Algorithms.- Ant Colony Algorithms.- Variants, Extensions and Methodological Advices.- Some Other Metaheuristics.- Extensions.- Methodology.- Case Studies.- Optimization of UMTS Radio Access Networks with Genetic Algorithms.- Genetic Algorithms Applied to Air Traffic Management.- Constraint Programming and Ant Colonies Applied to Vehicle Routing Problems.
Textul de pe ultima copertă
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.
• 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.
Caracteristici
Presents a family of advanced methods of optimization, called Metaheuristics Includes simulated annealing, tabu search, evolutionary and genetic algorithms, ant colonies Contains case studies from engineering and operations research Includes commented literature for each chapter