找回密码
 注册
搜索
热搜: 超星 读书 找书
查看: 648|回复: 0

[【资源下载】] Ant Colony Optimization (Bradford Books)

[复制链接]
发表于 2008-4-8 11:07:36 | 显示全部楼层 |阅读模式
Ant Colony Optimization (Bradford Books)
By Marco Dorigo, Thomas Stützle

--------------------------------------------------------------------------------



Publisher:  The MIT Press
Number Of Pages:  319
Publication Date:  2004-07-01
ISBN-10 / ASIN:  0262042193
ISBN-13 / EAN:  9780262042192
Binding:  Hardcover


--------------------------------------------------------------------------------

Product Description:

The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. 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 applications, including descriptions of many available ACO algorithms and their uses.

The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms.




--------------------------------------------------------------------------------

Summary: searching for the basic algorithms
Rating: 4

The central idea in the book is to analyse what evolution has provided us. In the form of ants being able to find the shortest path over terrain. This ability has inspired the research described herein.

The book can be read as a fascinating deconstructionist approach to observing and manipulating ant colonies. By trying to look under the observations to discern the fundamental algorithms at work. And then to apply these to such longstanding contexts as the Travelling Salesman Problem.



Summary: The intelligence and wisdom of ants
Rating: 5

Being an ant isn't very complex, but it's a daily fight for life. The losers in that fight don't count, but the winners get to vote.

That is the basis of ant colony optimization. There are many parts to the idea, all of them very simple. First, there are many routes to the goal (food, if you're an ant) - some are better, some worse, you don't know which are which in advance, and the answer may change over time. Second, it's a random search. If you find any answer at all, no matter how convoluted, you get to vote on your route. Third, there are many other ants, all voting. Any leg of a trip that is heavily followed must be part of a good route, and gets many votes. There are details, but that's about it.

Chapters 1-3 are the most readable, and convey the basic spirit of the family of algorithms. Ch. 4-6 will drag a bit, for the general reader, but go into significant detail about the ant algorithm and specific applications.

Ch. 7 ends the book with a warm, informal discussion of the algorithm's history and some delightful variations. Dorigo, the principal author and founder of the ant school, uses this chapter to express his pure joy at having found such a wonderful thing, and at the similar approaches that others have also found.

The approach has some real limits. For example, it can solve only problems that look like finding the shortest route. The good news is that a wide range of unlikely problems can all be cast in these terms. The better news is that, given the many variations available, some form of the 'stigmergic' approach will probably solve any problem in that range. Best of all, though, is the sheer cleverness and the sincere appreciation expressed by the authors.

Nature is economical, but a brilliant problem solver. This is written by someone who as able to listen in on one of the lessons.

//wiredweird



Summary: A comprehensive and very readable introduction
Rating: 5

Fifteen years after the elegant double-bridge experiments by Deneubourg et al. that formed the basis of the Ant Colony Optimization algorithm, Marco Dorigo, the inventor of ACO, and Thomas Stützle, an expert on stochastic local search methods, have pooled their knowledge to summarize the current state of the art.
This book gives a well paced introduction to ACO, describes its use in various optimization problems and gives interesting examples of its applications in industry. Explanations are clear and concise and, with the exception of a few well defined technical terms, free of scientific jargon. It is a pleasure to read for everyone with an interest in optimization theory. However, if you are looking for a book that celebrates the beauty of nature's problem solving capabilities, you are better of with \"Swarm Intelligence\" or Flake's \"Computational Beauty of Nature\". The initial idea of ACO may be bio-inspired, but this book has a crystal clear focus of the computational considerations in optimization theory.



Summary: A fine compilation
Rating: 5

This book is a fine compilation of what have been done with the Ant Colony paradigm so far. Highly readable, even for people without previous experience in the field of optimization.

http://mihd.net/4cva3pl/__0239a96__via_gigapedia.info__.html
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 注册

本版积分规则

Archiver|手机版|小黑屋|网上读书园地

GMT+8, 2024-9-25 01:24 , Processed in 0.075956 second(s), 4 queries , Redis On.

Powered by Discuz! X3.5

© 2001-2024 Discuz! Team.

快速回复 返回顶部 返回列表