Omega : A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems (Genetic Algorithms and Evolutionary Computation, 6)

個数：

Omega : A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems (Genetic Algorithms and Evolutionary Computation, 6)

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    【重要ご説明事項】
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Hardcover:ハードカバー版／ページ数 152 p.
  • 言語 ENG
  • 商品コード 9780792374602
  • DDC分類 519.3

Full Description

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.

Contents

1. Development of the Omega.- 1.1 The Mechanics of the Fast Messy GA.- 1.2 Using Random Keys for Representation.- 1.3 Designing the OmeGA.- 1.4 Ordering Deceptive Problems.- 1.5 Problem Codings.- 1.6 Experiments.- 1.7 Summary.- 2. Performance Analysis of the Omega.- 2.1 Scale-up Analysis.- 2.2 New Ordering Deceptive Problems.- 2.3 Tests with Uniform and Nonuniform Scaling.- 2.4 Test with Nonuniform Building-Block Size.- 2.5 Tests with Overlapping Building Blocks.- 2.6 Summary.- 3. Application to a Scheduling Problem.- 3.1 Introduction to Scheduling Problems.- 3.2 Problem Formulation.- 3.3 Schedule Representation and Decoding.- 3.4 Experiments.- 3.5 Summary.- 4. Conclusions and Future Work.- Appendices.- Appendix A: The Benchmark Input Data.- Appendix B: Best Schedules.- Appendix C: Source Code of OmeGA.- References.