Bioinspired Computation in Combinatorial Optimization / Natural Computing Series (PDF)

Authors have given tutorials on this topic at major international conferences

“A very nice and, with respect to the topics treated, a useful contribution to the literature. The book gives a very appealing introduction into the area of bio-inspired algorithms with solid results on the theoretical side, gathering many recent results which so far only have been available in research papers. … recommendable resource both for researchers who want to learn more on the topic and for preparing a course on bio-inspired algorithms. … Altogether this is a very recommendable textbook.” (Klaus Meer, Mathematical Reviews, February, 2015)

"This timely book will be useful to many researchers and advanced undergraduate and graduate students. The key strength of the book is the complexity analysis of the algorithms for a variety of combinatorial optimization problems on graphs. Furthermore, it provides a comprehensive treatment of evolutionary algorithms and ant colony optimization. The book is recommended to anyone working in the areas of computational complexity, combinatorial optimization, and engineering." (Manish Gupta, Computing Reviews, May, 2011)

“This book treats bio-inspired computing methods as stochastic algorithms and presents rigorous results on their runtime behavior. The book is meant to give researchers a state-of-the-art presentation of theoretical results on bio-inspired computing methods in the context of combinatorial optimization. It can be used as basic material for courses on bio-inspired computing that are meant for graduate students and advanced undergraduates.” (I. N. Katz, Zentralblatt MATH, Vol. 1223, 2011)