Skip to main content
  • Textbook
  • © 2010

Bioinspired Computation in Combinatorial Optimization

Algorithms and Their Computational Complexity

  • 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

  • Includes supplementary material: sn.pub/extras

Part of the book series: Natural Computing Series (NCS)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (13 chapters)

  1. Front Matter

    Pages I-XII
  2. Basics

    1. Front Matter

      Pages 1-1
    2. Introduction

      • Frank Neumann, Carsten Witt
      Pages 3-7
    3. Combinatorial Optimization and Computational Complexity

      • Frank Neumann, Carsten Witt
      Pages 9-19
    4. Stochastic Search Algorithms

      • Frank Neumann, Carsten Witt
      Pages 21-32
    5. Analyzing Stochastic Search Algorithms

      • Frank Neumann, Carsten Witt
      Pages 33-48
  3. Single-objective Optimization

    1. Front Matter

      Pages 49-49
    2. Minimum Spanning Trees

      • Frank Neumann, Carsten Witt
      Pages 51-74
    3. Maximum Matchings

      • Frank Neumann, Carsten Witt
      Pages 75-94
    4. Makespan Scheduling

      • Frank Neumann, Carsten Witt
      Pages 95-110
    5. Shortest Paths

      • Frank Neumann, Carsten Witt
      Pages 111-131
    6. Eulerian Cycles

      • Frank Neumann, Carsten Witt
      Pages 133-146
  4. Multi-objective Optimization

    1. Front Matter

      Pages 147-147
    2. Multi-objective Minimum Spanning Trees

      • Frank Neumann, Carsten Witt
      Pages 149-159
    3. Minimum Spanning Trees Made Easier

      • Frank Neumann, Carsten Witt
      Pages 161-169
    4. Covering Problems

      • Frank Neumann, Carsten Witt
      Pages 171-189
    5. Cutting Problems

      • Frank Neumann, Carsten Witt
      Pages 191-203
  5. Back Matter

    Pages 205-216

About this book

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.

Reviews

“A very nice and, with respect to the topics treated, a useful contribution to the literature. The book gives a very appealing introduction into the area of bio-inspired algorithms with solid results on the theoretical side, gathering many recent results which so far only have been available in research papers. … recommendable resource both for researchers who want to learn more on the topic and for preparing a course on bio-inspired algorithms. … Altogether this is a very recommendable textbook.” (Klaus Meer, Mathematical Reviews, February, 2015)

"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." (Manish Gupta, Computing Reviews, May, 2011)

“This 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)

"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 O'Reilly, 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)

Authors and Affiliations

  • Dept. of Algorithms and Complexity, Max Planck Institute for Informatics, Saarbrücken, Germany

    Frank Neumann

  • , Department of Informatics, Technical University of Denmark, Kgs. Lyngby, Denmark

    Carsten Witt

About the authors

Authors have given tutorials on this topic at major international conferences

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access