OmeGA. A competent genetic algorithm for solving permutation and scheduling problems
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)
The Kluwer series on genetic algorithms and evolutionary computation publishes research monographs, edited collections, and graduate-level text in the rapidly growing field. Dimitri Knjazew's book is the most recent addition to the series, and it is a nice ``recombination of two increasingly important areas in GA implementation and practice. Knjazew's system called OmeGA or the ordering messy genetic algorithm combines some of the latest in competent GA technology to solve scheduling and permutation problems. The purpose of this book is to develop a permutation-oriented competent GA and to demonstrate its performance and scalability on hard permutation problems. Moreover, the algorithm is applied to a real world scheduling problem that has been used as a standard benchmark within the German company SAP -- one of the leading enterprise resource planning software vendors. The introduction of the book provides the reader with background information about competent genetic algorithms. The first chapter develops the ordering messy genetic algorithm (OmeGA) and the second chapter presents a detailed scalability and performance analysis of the method. In the third chapter the OmeGA is applied to the SAP scheduling benchmark mentioned above. Conclusions and suggestions for future research are given in the last chapter. The appendices contain the problem data, some detailed optimization results, and the source code of the OmeGA in C++. In my opinion, the book has, besides advantages, also some drawbacks. One of the most important is a poor experimental justification of the approach proposed. OmeGA is tested on only one (complicated) example and its results are compared against only one other algorithm (another GA approach). Thus, the author's statement that: ``The results of this research suggest that in the near future competent genetic algorithms could be used as reliable problem solvers in many various fields including structural optimization, parameter optimization, scheduling, timetabling, and route planning seems to be far too optimistic.
- Geographic and network surveillance via scan statistics for critical area detection
- Competent genetic algorithms for weighing matrices
- scientific article; zbMATH DE number 1488084 (Why is no real title available?)
- OMEGA one multi ethnic genetic approach
- Multiprogramming genetic algorithm for optimization problems with permutation property
This page was built for publication: OmeGA. A competent genetic algorithm for solving permutation and scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4328479)