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

Dimitri Knjazew

ISBN 10: 1461352495 / ISBN 13: 9781461352495

Published by Springer US, 2012

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9781461352495

Bibliographic Details

• Title: OmeGA : A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems
• Publisher: Springer US
• Publication Date: 2012
• Language: English
• ISBN 10: 1461352495
• ISBN 13: 9781461352495
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 11D millimeters 235 millimeters width by 155 millimeters height by 11 millimeters depth
• Weight: 283 grams

About this title

Synopsis

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.