OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems

Front Cover
Springer Science & Business Media, Jan 31, 2002 - Computers - 152 pages

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.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

X
1
XI
11
XII
13
XIII
14
XIV
18
XV
19
XVI
24
XVII
27
XXIII
47
XXIV
51
XXV
55
XXVI
58
XXVII
62
XXVIII
68
XXIX
69
XXX
71

XVIII
28
XIX
33
XX
40
XXI
42
XXII
44
XXXI
79
XXXII
89
XXXIII
147
XXXIV
151
Copyright

Other editions - View all

Common terms and phrases

References to this book

Bibliographic information