Nature-inspired optimization algorithms

Author(s)

    • Yang, Xin-She

Bibliographic Information

Nature-inspired optimization algorithms

Xin-She Yang

(Elsevier insights)

Elsevier, 2014

Available at  / 5 libraries

Search this Book/Journal

Note

Includes bibliographical references

Description and Table of Contents

Description

Nature-Inspired Optimization Algorithms provides a systematic introduction to all major nature-inspired algorithms for optimization. The book's unified approach, balancing algorithm introduction, theoretical background and practical implementation, complements extensive literature with well-chosen case studies to illustrate how these algorithms work. Topics include particle swarm optimization, ant and bee algorithms, simulated annealing, cuckoo search, firefly algorithm, bat algorithm, flower algorithm, harmony search, algorithm analysis, constraint handling, hybrid methods, parameter tuning and control, as well as multi-objective optimization. This book can serve as an introductory book for graduates, doctoral students and lecturers in computer science, engineering and natural sciences. It can also serve a source of inspiration for new applications. Researchers and engineers as well as experienced experts will also find it a handy reference.

Table of Contents

1. Overview of Modern Nature-Inspired Algorithms2. Particle Swarm Optimization 3. Genetic Algorithms and Differential Evolution4. Simulated Annealing5. Ant Colony Optimization 6. Artificial Bee Colony and Other Bee Algorithms7. Cuckoo Search8. Firefly Algorithm9. Artificial Immune Systems10. Bat Algorithms 11. Neural Networks12. Other Optimization Algorithms 13. Constraint Handling Techniques14. Multiobjective Optimization Appendix A: Matlab Codes and Some Software LinksAppendix B: Commonly used test functions

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BB15911909
  • ISBN
    • 9780124167438
  • Country Code
    uk
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    London
  • Pages/Volumes
    xii, 263 p.
  • Size
    24 cm
  • Classification
  • Subject Headings
  • Parent Bibliography ID
Page Top