A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems

  • Dimitri¬†Knjazew

Part of the Genetic Algorithms and Evolutionary Computation book series (GENA, volume 6)

Table of contents

  1. Front Matter
    Pages i-xxi
  2. Dimitri Knjazew
    Pages 27-49
  3. Dimitri Knjazew
    Pages 51-68
  4. Dimitri Knjazew
    Pages 69-70
  5. Back Matter
    Pages 71-152

About this book


OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems addresses two increasingly important areas in GA implementation and practice. OmeGA, or the ordering messy genetic algorithm, combines some of the latest in competent GA technology to solve scheduling and other permutation problems. Competent GAs are those designed for principled solutions of hard problems, quickly, reliably, and accurately. Permutation and scheduling problems are difficult combinatorial optimization problems with commercial import across a variety of industries.

This book approaches both subjects systematically and clearly. The first part of the book presents the clearest description of messy GAs written to date along with an innovative adaptation of the method to ordering problems. The second part of the book investigates the algorithm on boundedly difficult test functions, showing principled scale up as problems become harder and longer. Finally, the book applies the algorithm to a test function drawn from the literature of scheduling.


Industrie algorithms calculus code combinatorial optimization design development genetic algorithms mutation optimization scheduling technology

Authors and affiliations

  • Dimitri¬†Knjazew
    • 1
  1. 1.SAP AGGermany

Bibliographic information

  • DOI
  • Copyright Information Kluwer Academic Publishers 2002
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-5249-5
  • Online ISBN 978-1-4615-0807-6
  • Series Print ISSN 1568-2587
  • Buy this book on publisher's site