Logo - springer
Slogan - springer

Computer Science - Artificial Intelligence | OmeGA - A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems

OmeGA

A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems

Knjazew, Dimitri

2002, XXI, 152 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$159.00

(net) price for USA

ISBN 978-1-4615-0807-6

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$199.00

(net) price for USA

ISBN 978-0-7923-7460-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$199.00

(net) price for USA

ISBN 978-1-4613-5249-5

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • About this book

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.

Content Level » Research

Keywords » Industrie - algorithms - calculus - code - combinatorial optimization - design - development - genetic algorithms - mutation - optimization - scheduling - technology

Related subjects » Artificial Intelligence - Mathematics - Theoretical Computer Science

Table of contents 

List of Figures. List of Tables. Foreword. Preface. Acknowledgments. Introduction. 1. Development of the OmeGA. 2. Performance Analysis of the OmeGA. 3. Application to a Scheduling Problem. 4. Conclusions and Future Work. Appendices. Appendix A: The Benchmark Input Data. Appendix B: Best Schedules. Appendix C: Source Code of OmeGA. References. Index.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Artificial Intelligence (incl. Robotics).