| 000 | 03429nam a22005295i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-72962-4 | ||
| 003 | DE-He213 | ||
| 005 | 20140220083740.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 110718s2011 gw | s |||| 0|eng d | ||
| 020 |
_a9783540729624 _9978-3-540-72962-4 |
||
| 024 | 7 |
_a10.1007/978-3-540-72962-4 _2doi |
|
| 050 | 4 | _aQ334-342 | |
| 050 | 4 | _aTJ210.2-211.495 | |
| 072 | 7 |
_aUYQ _2bicssc |
|
| 072 | 7 |
_aTJFM1 _2bicssc |
|
| 072 | 7 |
_aCOM004000 _2bisacsh |
|
| 082 | 0 | 4 |
_a006.3 _223 |
| 100 | 1 |
_aRothlauf, Franz. _eauthor. |
|
| 245 | 1 | 0 |
_aDesign of Modern Heuristics _h[electronic resource] : _bPrinciples and Application / _cby Franz Rothlauf. |
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011. |
|
| 300 |
_aXI, 267 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aNatural Computing Series, _x1619-7127 |
|
| 505 | 0 | _aChap. 1 -- Introduction -- Part I -- Fundamentals -- Chap. 2 -- Optimization Problems -- Chap. 3 -- Optimization Methods -- Part II -- Modern Heuristics -- Chap. 4 -- Design Elements -- Chap. 5 -- Search Strategies -- Chap. 6 -- Design Principles -- Part III Case Studies -- Chap. 7 -- High Locality Representations for Automated Programming -- Chap. 8.-Biased Modern Heuristics for the OCST Problem -- Chap. 9.-Summary -- References -- Nomenclature -- Glossary -- Index. | |
| 520 | _aMost textbooks on modern heuristics provide the reader with detailed descriptions of the functionality of single examples like genetic algorithms, genetic programming, tabu search, simulated annealing, and others, but fail to teach the underlying concepts behind these different approaches. The author takes a different approach in this textbook by focusing on the users' needs and answering three fundamental questions: First, he tells us which problems modern heuristics are expected to perform well on, and which should be left to traditional optimization methods. Second, he teaches us to systematically design the "right" modern heuristic for a particular problem by providing a coherent view on design elements and working principles. Third, he shows how we can make use of problem-specific knowledge for the design of efficient and effective modern heuristics that solve not only small toy problems but also perform well on large real-world problems. This book is written in an easy-to-read style and it is aimed at students and practitioners in computer science, operations research and information systems who want to understand modern heuristics and are interested in a guide to their systematic design and use. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 0 | _aMathematical optimization. | |
| 650 | 0 | _aEngineering. | |
| 650 | 0 | _aManagement information systems. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
| 650 | 2 | 4 | _aOptimization. |
| 650 | 2 | 4 | _aComputational Intelligence. |
| 650 | 2 | 4 | _aBusiness Information Systems. |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540729617 |
| 830 | 0 |
_aNatural Computing Series, _x1619-7127 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-540-72962-4 |
| 912 | _aZDB-2-SCS | ||
| 999 |
_c106649 _d106649 |
||