✍ Scribed by Johann Dréo, Alain Pétrowski, Patrick Siarry, Eric Taillard, A. Chatterjee
No coin nor oath required. For personal study only.
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.
📜 SIMILAR VOLUMES
Contains case studies from engineering and operations research Includes commented literature for each chapter
<p><P>Metaheuristics for Hard Optimization comprises of three parts. The first part is devoted to the detailed presentation of the four most widely known metaheuristics:</P><P>• the simulated annealing method,</P><P>• tabu search,</P><P>• the evolutionary algorithms,</P><P>• ant colony algorithms.</
Contains chapters which are organized into parts on simulated annealing, tabu search, ant colony algorithms, general-purpose studies of evolutionary algorithms, applications of evolutionary algorithms, and various metaheuristics. This book gathers contributions related to: theoretical developments
<p><P>Many advances have been made recently in metaheuristic methods, from theory to applications. The editors, both leading experts in this field, have assembled a team of researchers to contribute 21 chapters organized into parts on simulated annealing, tabu search, ant colony algorithms, general-
Many advances have been made recently in metaheuristic methods, from theory to applications. The editors, both leading experts in this field, have assembled a team of researchers to contribute 21 chapters organized into parts on simulated annealing, tabu search, ant colony algorithms, general-purpos