LIKE NEW: This book is in excellent, like-new condition.
Product Details
Continued from the back cover: "The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical appreciations, including descriptions of many available ACO algorithms and their uses."
From the Preface: "Overall, this book can be read easily by anyone with a college-level scientific background. The use of mathematics is rather limited throughout, except for chapter 4, which requires some deeper knowledge of probability theory. However, we assume that the reader is familiar with some basic notions of graph theory, programming, and probabilities. The book is intended for (1) academic and industry researchers in operations research, artificial intelligence, and computational intelligence; (2) practitioners willing to learn how to implement ACO algorithms to solve combinatorial optimization problems; and (3) graduate and last-year undergraduate students in computer science, management science, operations research, and artificial intelligence."
Chapters
From Real to Artificial Ants
The Ant Colony Optimization Metaheuristic
Ant Colony Optimization Algorithms for the Traveling Salesman Problem
Ant Colony Optimization Theory
Ant Colony Optimization for NP-Hard Problems
AntNet: An ACO Algorithm for Data Networking Routing
