Advertisement

Bioinspired Computation in Combinatorial Optimization

Algorithms and Their Computational Complexity

  • Frank Neumann
  • Carsten Witt

Part of the Natural Computing Series book series (NCS)

Table of contents

  1. Front Matter
    Pages I-XII
  2. Basics

    1. Front Matter
      Pages 1-1
    2. Frank Neumann, Carsten Witt
      Pages 3-7
    3. Frank Neumann, Carsten Witt
      Pages 9-19
    4. Frank Neumann, Carsten Witt
      Pages 21-32
    5. Frank Neumann, Carsten Witt
      Pages 33-48
  3. Single-objective Optimization

    1. Front Matter
      Pages 49-49
    2. Frank Neumann, Carsten Witt
      Pages 51-74
    3. Frank Neumann, Carsten Witt
      Pages 75-94
    4. Frank Neumann, Carsten Witt
      Pages 95-110
    5. Frank Neumann, Carsten Witt
      Pages 111-131
    6. Frank Neumann, Carsten Witt
      Pages 133-146
  4. Multi-objective Optimization

    1. Front Matter
      Pages 147-147
    2. Frank Neumann, Carsten Witt
      Pages 149-159
    3. Frank Neumann, Carsten Witt
      Pages 161-169
    4. Frank Neumann, Carsten Witt
      Pages 171-189
    5. Frank Neumann, Carsten Witt
      Pages 191-203
  5. Back Matter
    Pages 205-216

About this book

Introduction

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.

 

Keywords

Bioinspired computing Computational complexity Evolutionary algorithms Minimum spanning trees Multiobjective optimization Natural computing Optimization algorithms combinatorial optimization evolutionary algorithm multi-objective optimization scheduling

Authors and affiliations

  • Frank Neumann
    • 1
  • Carsten Witt
    • 2
  1. 1.Dept. of Algorithms and ComplexityMax Planck Institute for InformaticsSaarbrückenGermany
  2. 2., Department of InformaticsTechnical University of DenmarkKgs. LyngbyDenmark

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-16544-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-16543-6
  • Online ISBN 978-3-642-16544-3
  • Series Print ISSN 1619-7127
  • Buy this book on publisher's site
Industry Sectors
Pharma
Materials & Steel
Finance, Business & Banking
Aerospace
Oil, Gas & Geosciences
Engineering