This book illustrates recent bio-inspired efficient algorithms for solving NP-hard problems. Discusses theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots, variations of the Traveling Salesman Problem and more.

"Advances in Bio-inspired Combinatorial Optimization Problems" illustrates several recent bio-inspired efficient algorithms for solving NP-hard problems.

Theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots are described. Large-scale optimization problems, for example: the Generalized Traveling Salesman Problem and the Railway Traveling Salesman Problem, are solved and their results are discussed.

Some of the main concepts and models described in this book are: inner rule to guide ant search - a recent model in ant optimization, heterogeneous sensitive ants; virtual sensitive robots; ant-based techniques for static and dynamic routing problems; stigmergic collaborative agents and learning sensitive agents.

This monograph is useful for researchers, students and all people interested in the recent natural computing frameworks. The reader is presumed to have knowledge of combinatorial optimization, graph theory, algorithms and programming. The book should furthermore allow readers to acquire ideas, concepts and models to use and develop new software for solving complex real-life problems.

Introduces new bio-inspired techniques based on ants, agents and virtual robots Solves real-life complex problems using the introduced bio-inspired techniques Recent research on Bio-inspired Computing for Combinatorial Optimization Problems

Inhalt
Part I Biological Computing and Optimization.- Part II Ant Algorithms.- Part III Bio-inspired Multi-Agent Systems.- Part IV Applications with Bio-inspired Algorithms.- Part V Conclusions and Remarks.