OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems
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 perm...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer US
2002
|
| Ausgabe: | 1st ed. 2002 |
| Schriftenreihe: | Genetic Algorithms and Evolutionary Computation
6 |
| Schlagworte: | |
| Online-Zugang: | UBY01 Volltext |
| Zusammenfassung: | 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 |
| Beschreibung: | 1 Online-Ressource (XXI, 152 p) |
| ISBN: | 9781461508076 |
| DOI: | 10.1007/978-1-4615-0807-6 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV047063977 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2002 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461508076 |9 978-1-4615-0807-6 | ||
| 024 | 7 | |a 10.1007/978-1-4615-0807-6 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-1-4615-0807-6 | ||
| 035 | |a (OCoLC)1227477836 | ||
| 035 | |a (DE-599)BVBBV047063977 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 006.3 |2 23 | |
| 084 | |a QH 465 |0 (DE-625)141600: |2 rvk | ||
| 100 | 1 | |a Knjazew, Dimitri |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a OmeGA |b A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems |c by Dimitri Knjazew |
| 250 | |a 1st ed. 2002 | ||
| 264 | 1 | |a New York, NY |b Springer US |c 2002 | |
| 300 | |a 1 Online-Ressource (XXI, 152 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Genetic Algorithms and Evolutionary Computation |v 6 | |
| 520 | |a 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 | ||
| 650 | 4 | |a Artificial Intelligence | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Optimization | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Computers | |
| 650 | 4 | |a Mathematical optimization | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780792374602 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461352495 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461508083 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4615-0807-6 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471089 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4615-0807-6 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182061403078656 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Knjazew, Dimitri |
| author_facet | Knjazew, Dimitri |
| author_role | aut |
| author_sort | Knjazew, Dimitri |
| author_variant | d k dk |
| building | Verbundindex |
| bvnumber | BV047063977 |
| classification_rvk | QH 465 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-1-4615-0807-6 (OCoLC)1227477836 (DE-599)BVBBV047063977 |
| dewey-full | 006.3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 006 - Special computer methods |
| dewey-raw | 006.3 |
| dewey-search | 006.3 |
| dewey-sort | 16.3 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Wirtschaftswissenschaften |
| discipline_str_mv | Informatik Wirtschaftswissenschaften |
| doi_str_mv | 10.1007/978-1-4615-0807-6 |
| edition | 1st ed. 2002 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02811nmm a2200493zcb4500</leader><controlfield tag="001">BV047063977</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461508076</subfield><subfield code="9">978-1-4615-0807-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4615-0807-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-4615-0807-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227477836</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047063977</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 465</subfield><subfield code="0">(DE-625)141600:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Knjazew, Dimitri</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">OmeGA</subfield><subfield code="b">A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems</subfield><subfield code="c">by Dimitri Knjazew</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2002</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer US</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XXI, 152 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Genetic Algorithms and Evolutionary Computation</subfield><subfield code="v">6</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780792374602</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781461352495</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781461508083</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4615-0807-6</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471089</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4615-0807-6</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047063977 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:21Z |
| indexdate | 2024-07-10T09:01:34Z |
| institution | BVB |
| isbn | 9781461508076 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471089 |
| oclc_num | 1227477836 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (XXI, 152 p) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Springer US |
| record_format | marc |
| series2 | Genetic Algorithms and Evolutionary Computation |
| spelling | Knjazew, Dimitri Verfasser aut OmeGA A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems by Dimitri Knjazew 1st ed. 2002 New York, NY Springer US 2002 1 Online-Ressource (XXI, 152 p) txt rdacontent c rdamedia cr rdacarrier Genetic Algorithms and Evolutionary Computation 6 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 Artificial Intelligence Theory of Computation Optimization Artificial intelligence Computers Mathematical optimization Erscheint auch als Druck-Ausgabe 9780792374602 Erscheint auch als Druck-Ausgabe 9781461352495 Erscheint auch als Druck-Ausgabe 9781461508083 https://doi.org/10.1007/978-1-4615-0807-6 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Knjazew, Dimitri OmeGA A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems Artificial Intelligence Theory of Computation Optimization Artificial intelligence Computers Mathematical optimization |
| title | OmeGA A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems |
| title_auth | OmeGA A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems |
| title_exact_search | OmeGA A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems |
| title_exact_search_txtP | OmeGA A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems |
| title_full | OmeGA A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems by Dimitri Knjazew |
| title_fullStr | OmeGA A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems by Dimitri Knjazew |
| title_full_unstemmed | OmeGA A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems by Dimitri Knjazew |
| title_short | OmeGA |
| title_sort | omega a competent genetic algorithm for solving permutation and scheduling problems |
| title_sub | A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems |
| topic | Artificial Intelligence Theory of Computation Optimization Artificial intelligence Computers Mathematical optimization |
| topic_facet | Artificial Intelligence Theory of Computation Optimization Artificial intelligence Computers Mathematical optimization |
| url | https://doi.org/10.1007/978-1-4615-0807-6 |
| work_keys_str_mv | AT knjazewdimitri omegaacompetentgeneticalgorithmforsolvingpermutationandschedulingproblems |