"Inspired by the remarkable ability of social insects to solve problems, Dorigo and Stutzle introduce highly creative new technological design principles for seeking optimized solutions to extremely difficult real-world problems, such as network routing and task scheduling. This is essential reading not only for those working in artificial intelligence and optimization, but for all of us who find the interface between biology and technology fascinating."--Iain D. Couzin, University of Oxford
An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications. 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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 13,95 gastos de envío desde Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envíoEUR 3,76 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoLibrería: Anybook.com, Lincoln, Reino Unido
Condición: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,750grams, ISBN:9780262042192. Nº de ref. del artículo: 7097462
Cantidad disponible: 1 disponibles
Librería: Anybook.com, Lincoln, Reino Unido
Condición: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,750grams, ISBN:9780262042192. Nº de ref. del artículo: 7097461
Cantidad disponible: 1 disponibles
Librería: ebooks Keystone, Reading, PA, Estados Unidos de America
Condición: good. This book is in good condition, with minimal signs of wear and tear. Nº de ref. del artículo: GWKV.0262042193.G
Cantidad disponible: 1 disponibles
Librería: Moe's Books, Berkeley, CA, Estados Unidos de America
Hard cover. Condición: Very good. No jacket. The cover is shelf worn. Binding is tight and inside is clean and unmarked. Nº de ref. del artículo: 1149012
Cantidad disponible: 1 disponibles
Librería: Grumpys Fine Books, Tijeras, NM, Estados Unidos de America
Hardcover. Condición: new. Prompt service guaranteed. Nº de ref. del artículo: Clean0262042193
Cantidad disponible: 1 disponibles