Description
Book SynopsisThis book includes introduction of several algorithms which are exclusively for graph based problems, namely combinatorial optimization problems, path formation problems, etc. Each chapter includes the introduction of the basic traditional nature inspired algorithm and discussion of the modified version for discrete algorithms including problems pertaining to discussed algorithms.
Trade Review"Each chapter includes detailed problem formulation, practical examples, flowcharts illustrating special algorithms, questions and solved exercises which reinforce important topics. Besides being very useful to those who are interested in discrete optimizations problems and applying various metaheuristics to them, involved reader can also benefit from the easy way it presents various ideas and approaches to problem solutions. It is written in a clean and easily understandable, but still highly scientific language and it is a beneficial reading for post-docs and researchers interested in metaheuristic approaches to graph-based discrete optimization problems."
—Zentralblatt MATH
Table of Contents1. Introduction to Optimization Problems 2. Particle Swarm Optimization 3. Genetic Algorithms 4. Ant Colony Optimization 5. Bat Algorithm 6. Cuckoo Search Algorithm 7. Artificial Bee Colony 8. Shuffled Frog Leap Algorithm 9. Brain Storm Swarm Optimization Algorithm 10. Intelligent Water Drop Algorithm 11. Egyptian Vulture Algorithm 12. Biogeography-Based Optimization 13. Invasive Weed Optimization 14. Glowworm Swarm Optimization 15. Bacteria Foraging Optimization Algorithm 16. Flower Pollination Algorithm
