<P><STRONG>Nature-Inspired Optimization Algorithms,&nbsp;</STRONG>a comprehensive&nbsp;work on the most popular optimization algorithms based on nature,&nbsp;starts with an overview of optimization&nbsp;going from the classical to the latest swarm intelligence algorithm. Nature has a rich abundance of flora and fauna that inspired the development of optimization techniques, providing us with simple solutions to complex problems in an effective and adaptive manner. The study of the intelligent survival strategies of animals, birds, and insects in a hostile and ever-changing environment has led to the development of techniques emulating their behavior.
<P></P>This book is a lucid description of fifteen important existing optimization algorithms based on swarm intelligence and superior in performance. It is a valuable resource for engineers, researchers, faculty, and students who are devising optimum solutions to any type of problem ranging&nbsp;from computer science to economics and&nbsp;covering diverse areas that require maximizing output and minimizing resources. This is the crux of all optimization algorithms.
<P></P>Features:
<P></P>
<UL>
<P>
<LI>Detailed description of the algorithms along with pseudocode and flowchart</LI>
<P></P>
<P>
<LI>Easy translation to program code that is also readily available in <I>Mathworks </I>website for some of the algorithms</LI>
<P></P>
<P>
<LI>Simple examples demonstrating the optimization strategies are provided to enhance understanding </LI>
<P></P>
<P>
<LI>Standard applications and benchmark datasets for testing and validating the algorithms are included</LI></UL>
<P></P>
<P>This book is a reference for undergraduate and post-graduate students. It will be useful to faculty members teaching optimization. It is also a comprehensive guide for researchers who are looking for optimizing resources in attaining the best solution to a problem. The nature-inspired optimization algorithms are unconventional, and this makes them more efficient than their traditional counterparts. </P>