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

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

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.