|
" Foraging-inspired optimisation algorithms / "
Anthony Brabazon, Seán McGarraghy.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
863935
|
| Main Entry
|
:
|
Brabazon, Anthony
|
| Title & Author
|
:
|
Foraging-inspired optimisation algorithms /\ Anthony Brabazon, Seán McGarraghy.
|
| Publication Statement
|
:
|
Cham, Switzerland :: Springer,, 2018.
|
| Series Statement
|
:
|
Natural computing series,
|
| Page. NO
|
:
|
1 online resource (xviii, 478 pages)
|
| ISBN
|
:
|
3319591568
|
|
|
:
|
: 3319591576
|
|
|
:
|
: 9783319591568
|
|
|
:
|
: 9783319591575
|
|
|
:
|
331959155X
|
|
|
:
|
9783319591551
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references and index.
|
| Contents
|
:
|
Introduction -- Perspectives on foraging -- Foraging-inspired algorithms for optimisation -- Vertebrates -- Invertebrates -- Nonneuronal organisms -- Algorithms derived from formal models of foraging -- Evolving a foraging strategy -- Foraging algorithms : the future.
|
| Abstract
|
:
|
This book is an introduction to relevant aspects of the foraging literature for algorithmic design, and an overview of key families of optimization algorithms that stem from a foraging metaphor. The authors first offer perspectives on foraging and foraging-inspired algorithms for optimization, they then explain the techniques inspired by the behaviors of vertebrates, invertebrates, and non-neuronal organisms, and they then discuss algorithms based on formal models of foraging, how to evolve a foraging strategy, and likely future developments. No prior knowledge of natural computing is assumed. This book will be of particular interest to graduate students, academics and practitioners in computer science, informatics, data science, management science, and other application domains.
|
| Subject
|
:
|
Biomimicry.
|
| Subject
|
:
|
Mathematical optimization.
|
| Subject
|
:
|
Biomimicry.
|
| Subject
|
:
|
Mathematical optimization.
|
| Dewey Classification
|
:
|
519.6
|
| LC Classification
|
:
|
QA402.5
|
| Added Entry
|
:
|
McGarraghy, Seán
|
| |