OmeGA

OmeGA, or the ordering messy genetic algorithm, combines contemporary advances 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 importance across a variety of industries. This book approaches these subjects systematically and clearly. The first part of the book presents a description of messy GAs 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.