Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity

Carsten Witt

ISBN 10: 3642165435 / ISBN 13: 9783642165436

Published by Springer Berlin Heidelberg, 2010

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9783642165436

Bibliographic Details

• Title: Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity
• Publisher: Springer Berlin Heidelberg
• Publication Date: 2010
• Language: English
• ISBN 10: 3642165435
• ISBN 13: 9783642165436
• Binding: Buch
• Condition: Neu
• Dimensions: 241W x 160H x 19D millimeters 241 millimeters width by 160 millimeters height by 19 millimeters depth
• Weight: 554 grams

About this title

Synopsis

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.

About the Author

Authors have given tutorials on this topic at major international conferences