|
|
|
|
| LEADER |
02045nma a2200325 u 4500 |
| 001 |
EB001990405 |
| 003 |
EBX01000000000000001153307 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210512 ||| eng |
| 020 |
|
|
|a 9781789233292
|
| 020 |
|
|
|a 9781789233285
|
| 020 |
|
|
|a 9781838815721
|
| 020 |
|
|
|a intechopen.71401
|
| 100 |
1 |
|
|a Del Ser, Javier
|
| 245 |
0 |
0 |
|a Nature-inspired Methods for Stochastic, Robust and Dynamic Optimization
|h Elektronische Ressource
|
| 260 |
|
|
|b IntechOpen
|c 2018
|
| 300 |
|
|
|a 1 electronic resource (70 p.)
|
| 653 |
|
|
|a Probability and statistics / bicssc
|
| 653 |
|
|
|a Optimization
|
| 700 |
1 |
|
|a Osaba, Eneko
|
| 700 |
1 |
|
|a Del Ser, Javier
|
| 700 |
1 |
|
|a Osaba, Eneko
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b DOAB
|a Directory of Open Access Books
|
| 500 |
|
|
|a Creative Commons (cc), https://creativecommons.org/licenses/by/3.0/
|
| 028 |
5 |
0 |
|a 10.5772/intechopen.71401
|
| 856 |
4 |
2 |
|u https://directory.doabooks.org/handle/20.500.12854/66931
|z DOAB: description of the publication
|
| 856 |
4 |
0 |
|u https://mts.intechopen.com/storage/books/6587/authors_book/authors_book.pdf
|7 0
|x Verlag
|3 Volltext
|
| 520 |
|
|
|a Nature-inspired algorithms have a great popularity in the current scientific community, being the focused scope of many research contributions in the literature year by year. The rationale behind the acquired momentum by this broad family of methods lies on their outstanding performance evinced in hundreds of research fields and problem instances. This book gravitates on the development of nature-inspired methods and their application to stochastic, dynamic and robust optimization. Topics covered by this book include the design and development of evolutionary algorithms, bio-inspired metaheuristics, or memetic methods, with empirical, innovative findings when used in different subfields of mathematical optimization, such as stochastic, dynamic, multimodal and robust optimization, as well as noisy optimization and dynamic and constraint satisfaction problems.
|