Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Comp

Description: Bioinspired Computation in Combinatorial Optimization by Frank Neumann, Carsten Witt Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. FORMAT Hardcover LANGUAGE English CONDITION Brand New Publisher Description Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field. Notes Authors have given tutorials on this topic at major international conferencesText has been class-tested by the authors and their collaboratorsComprehensive introduction for researchers Back Cover Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are being applied successfully to complex engineering and combinatorial optimization problems, and it is very important that we understand the computational complexity of these search heuristics. This is the first book to explain the most important results achieved in this area. The authors show how runtime behavior can be analyzed in a rigorous way. in particular for combinatorial optimization. They present well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems. Classical single-objective optimization is examined first. They then investigate the computational complexity of bioinspired computation applied to multiobjective variants of the considered combinatorial optimization problems, and in particular they show how multiobjective optimization can help to speed up bioinspired computation for single-objective optimization problems. This book will be valuable for graduate and advanced undergraduate courses on bioinspired computation, as it offers clear assessments of the benefits and drawbacks of various methods. It offers a self-contained presentation, theoretical foundations of the techniques, a unified framework for analysis, and explanations of common proof techniques, so it can also be used as a reference for researchers in the areas of natural computing, optimization and computational complexity. Author Biography Authors have given tutorials on this topic at major international conferences Table of Contents Basics.- Combinatorial Optimization and Computational Complexity.- Stochastic Search Algorithms.- Analyzing Stochastic Search Algorithms.- Single-objective Optimization.- Minimum Spanning Trees.- Maximum Matchings.- Makespan Scheduling.- Shortest Paths.- Eulerian Cycles.- Multi-objective Optimization.- Multi-objective Minimum Spanning Trees.- Minimum Spanning Trees Made Easier.- Covering Problems.- Cutting Problems. Review "Bioinspired computing is successful in practice. Over the past decade a body of theory for bioinspired computing has been developed. The authors have contributed significantly to this body and give a highly readable account of it." Kurt Mehlhorn, Max Planck Institute for Informatics, and Saarland University, Germany "Bioinspired algorithms belong to the most powerful methods used to tackle real world optimization problems. This book gives such algorithms a solid foundation. It presents some of the most exciting results that have been obtained in bioinspired computing in the last decade." Zbigniew Michalewicz, University of Adelaide, Australia "This book presents a most welcome theoretical computer science approach and perspective to the design and analysis of discrete evolutionary algorithms. It describes the design and derivation of evolutionary algorithms which have precise computation complexity bounds for combinatorial optimization. The book should appeal to researchers and practitioners of evolutionary algorithms and computation who want to learn the state of the art in evolutionary algorithm theory." Una-May OReilly, CSAIL, MIT, USA "The evolutionary computation community has been in need of rigorous results concerning the computational complexity of their approaches for decades. This is the first textbook covering such a fundamental topic. It provides an excellent overview of the state of the art in this research area, in terms of both the results obtained and the analytical methods. It is an indispensable book for everyone who is interested in the foundations of evolutionary computation." Xin Yao, University of Birmingham, UK "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." ACM Computing Reviews, Manish Gupta, May 2011 Promotional "Bioinspired computing is successful in practice. Over the past decade a body of theory for bioinspired computing has been developed. The authors have contributed significantly to this body and give a highly readable account of it." (Kurt Mehlhorn, Max Planck Institute for Informatics, and Saarland University, Germany) "Bioinspired algorithms belong to the most powerful methods used to tackle real world optimization problems. This book gives such algorithms a solid foundation. It presents some of the most exciting results that have been obtained in bioinspired computing in the last decade." (Zbigniew Michalewicz, University of Adelaide, Australia) "This book presents a most welcome theoretical computer science approach and perspective to the design and analysis of discrete evolutionary algorithms. It describes the design and derivation of evolutionary algorithms which have precise computation complexity bounds for combinatorial optimization. The book should appeal to researchers and practitioners of evolutionary algorithms and computation who want to learn the state of the art in evolutionary algorithm theory." (Una-May OReilly, CSAIL, MIT, USA) "The evolutionary computation community has been in need of rigorous results concerning the computational complexity of their approaches for decades. This is the first textbook covering such a fundamental topic. It provides an excellent overview of the state of the art in this research area, in terms of both the results obtained and the analytical methods. It is an indispensable book for everyone who is interested in the foundations of evolutionary computation." (Xin Yao, University of Birmingham, UK) Long Description Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes. This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field. Review Quote From the reviews:"Bioinspired computing is successful in practice. Over the past decade a body of theory for bioinspired computing has been developed. The authors have contributed significantly to this body and give a highly readable account of it." Kurt Mehlhorn, Max Planck Institute for Informatics, and Saarland University, Germany"Bioinspired algorithms belong to the most powerful methods used to tackle real world optimization problems. This book gives such algorithms a solid foundation. It presents some of the most exciting results that have been obtained in bioinspired computing in the last decade." Zbigniew Michalewicz, University of Adelaide, Australia"This book presents a most welcome theoretical computer science approach and perspective to the design and analysis of discrete evolutionary algorithms. It describes the design and derivation of evolutionary algorithms which have precise computation complexity bounds for combinatorial optimization. The book should appeal to researchers and practitioners of evolutionary algorithms and computation who want to learn the state of the art in evolutionary algorithm theory." Una-May OReilly, CSAIL, MIT, USA"The evolutionary computation community has been in need of rigorous results concerning the computational complexity of their approaches for decades. This is the first textbook covering such a fundamental topic. It provides an excellent overview of the state of the art in this research area, in terms of both the results obtained and the analytical methods. It is an indispensable book for everyone who is interested in the foundations of evolutionary computation." Xin Yao, University of Birmingham, UK"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." ACM Computing Reviews, Manish Gupta, May 2011This 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) Feature Authors have given tutorials on this topic at major international conferences Text has been class-tested by the authors and their collaborators Comprehensive introduction for researchers Details ISBN3642165435 Author Carsten Witt Series Natural Computing Series Year 2010 ISBN-10 3642165435 ISBN-13 9783642165436 Format Hardcover Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K Place of Publication Berlin Country of Publication Germany DEWEY 006.3 Short Title BIOINSPIRED COMPUTATION IN COM Language English Media Book Subtitle Algorithms and Their Computational Complexity Pages 216 Illustrations XII, 216 p. DOI 10.1007/978-3-642-16544-3 Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Edition Description 2010 ed. Edition 2010th Publication Date 2010-11-05 Alternative 9783642265846 Audience Professional & Vocational We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:96376113;

Price: 116.58 AUD

Location: Melbourne

End Time: 2024-12-05T10:02:35.000Z

Shipping Cost: 11.6 AUD