Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Nature-inspired computing : physics and chemistry-based algorithms
Siddique N., Adeli H., Chapman & Hall/CRC, New York, NY, 2017. 622 pp. Type: Book (978-1-482244-82-3)
Date Reviewed: Jan 15 2018

In recent years, a great deal of research interest has grown in nature-inspired computing, that is, computing involving the fundamental concepts of physics, chemistry, and biology. The discipline is now quite mature and established. Siddique and Adeli’s book is a comprehensive treatise on the subject with real-life engineering applications.

The book has ten chapters. Chapter 1, “Dialects of Nature Inspiration for Computing,” is introductory. The subtopics include a brief history of natural sciences, traditional approaches to search and optimization, and algorithms based on physics, chemistry, and biology. Chapter 2 focuses on gravitational search algorithms. Chapters 3 and 4 cover central force optimization and electromagnetism-like optimization, respectively. The other topics dealt with in the book include harmony search (chapter 5), the water drop algorithm (chapter 6), the spiral dynamics algorithm (chapter 7), simulated annealing (chapter 8), chemical reaction optimization (chapter 9), and finally miscellaneous algorithms (chapter 10). Each chapter provides the reader with engineering applications of the algorithms discussed therein. The last chapter deserves a special mention as it includes a wide variety of interesting and useful algorithms, such as the black hole algorithm, integrated radiation optimization, charged system search, and the external optimization algorithm, to name a few. This is followed by a lucid bibliography and notes on vectors and matrices, random numbers, chaotic maps, optimization, and the probability distribution function, spread over appendices A to E, respectively.

The target readership includes both students--undergraduate as well as postgraduate--and researchers in engineering, business, economics, and computing science. The prerequisite is adequate knowledge of calculus, differential equations, and optimization techniques.

I enjoyed reading this book and would definitely recommend it for any scientific library.

Reviewer:  Soubhik Chakraborty Review #: CR145771 (1803-0125)
Bookmark and Share
  Featured Reviewer  
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
 
Physics (J.2 ... )
 
 
Optimization (G.1.6 )
 
 
Problem Solving, Control Methods, And Search (I.2.8 )
 
Would you recommend this review?
yes
no
Other reviews under "Nonnumerical Algorithms And Problems": Date
Improving the performance guarantee for approximate graph coloring
Wigderson A. Journal of the ACM 30(4): 729-735, 1983. Type: Article
Feb 1 1985
Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
Demel J., Demlová M., Koubek V. Theoretical Computer Science 36(2-3): 203-216, 1985. Type: Article
Jan 1 1986
Complexity of the word problem for commutative semigroups of fixed dimension
Huynh D. Acta Informatica 22(4): 421-432, 1985. Type: Article
May 1 1986
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy