Metaheuristics for hard optimization: methods and case studies Dreo, J.
Material type: TextPublication details: Berlin Springer 2006 Description: xii, 369 pISBN:- 9783540230229
- 519.3
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
Book | Ahmedabad | 519.3 P3M3 (Browse shelf(Opens below)) | Available | 159740 |
Browsing Ahmedabad shelves Close shelf browser (Hides shelf browser)
519.3 P3E7 Epistemic game theory: reasoning and choice | 519.3 P3E9 Evolutionary algorithms | 519.3 P3G2 Game theory: a multi-leveled approach | 519.3 P3M3 Metaheuristics for hard optimization: methods and case studies | 519.3 R3/2004 Recent advances in optimization | 519.3 R6T9 Twenty lectures on algorithmic game theory | 519.3 S2C6 Combinatorial optimization: polyhedra and efficiency |
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.
There are no comments on this title.