Articoli correlati a OmeGA: A Competent Genetic Algorithm for Solving Permutation...
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
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.
Product Description
Book by Knjazew Dimitri
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 92,27
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per OmeGA: A Competent Genetic Algorithm for Solving Permutation...
Immagini fornite dal venditore
OmeGA
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 lates. Codice articolo 4193484
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
OmeGA
Editore:
Springer US, Springer New York Okt 2012, 2012
ISBN 10: 1461352495
ISBN 13: 9781461352495
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 180 pp. Englisch. Codice articolo 9781461352495
Quantità: 1 disponibili
Foto dell'editore
OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems (Genetic Algorithms and Evolutionary Computation)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9781461352495_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
OmeGA : A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. 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. Codice articolo 9781461352495
Quantità: 1 disponibili
Foto dell'editore
OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems
Editore:
Springer-Verlag New York Inc., 2012
ISBN 10: 1461352495
ISBN 13: 9781461352495
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 293. Codice articolo C9781461352495
Quantità: Più di 20 disponibili
Foto dell'editore
OmeGA
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 182. Codice articolo 2658587183
Quantità: 4 disponibili
Foto dell'editore
OmeGA
Print on DemandDa: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Print on Demand pp. 182 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Codice articolo 51005424
Quantità: 4 disponibili
Foto dell'editore
OmeGA
Print on DemandDa: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. 182. Codice articolo 1858587173
Quantità: 4 disponibili
Foto dell'editore
OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems (Genetic Algorithms and Evolutionary Computation)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar2716030031995
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
OmeGA
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 180 pp. Englisch. Codice articolo 9781461352495
Quantità: 2 disponibili