%0 Conference Paper %1 watson:1999:ICGA %A Watson, Richard A. %A Pollack, Jordan B. %B Proceedings of the Genetic and Evolutionary Computation Conference %C Orlando, Florida, USA %D 1999 %E Banzhaf, Wolfgang %E Daida, Jason %E Eiben, Agoston E. %E Garzon, Max H. %E Honavar, Vasant %E Jakiela, Mark %E Smith, Robert E. %I Morgan Kaufmann %K (H-IFF) Algorithms, Genetic Hierarchical-if-and-only-if Messy algorithms and classifier genetic systems, %P 710--717 %T Incremental Commitment in Genetic Algorithms %U http://www.cs.bham.ac.uk/~wbl/biblio/gecco1999/GA-887.ps %V 1 %X Successful recombination in the simple GA requires that interdependent genes be close to each other on the genome. Several methods have been proposed to reorder genes on the genome when the given ordering is unfavorable. The Messy GA (MGA) is one such 'moving-locus' scheme. However, gene reordering is only part of the Messy picture. The MGA uses another mechanism that is influential in enabling successful recombination. Specifically, the use of partial specification (or variable length genomes) allows the individuals themselves, rather than the ordering of genes within an individual, to represent which genes 'go together' during recombination. This paper examines this critical feature of the MGA and illustrates the impact that partial specification has on recombination. We formulate an Incremental Commitment GA that uses partially specified representations and recombination inspired by the MGA but separates these features from the moving-locus aspects and many of the other features of the existing algorithm. %@ 1-55860-611-4

@inproceedings{watson:1999:ICGA, abstract = {Successful recombination in the simple GA requires that interdependent genes be close to each other on the genome. Several methods have been proposed to reorder genes on the genome when the given ordering is unfavorable. The Messy GA (MGA) is one such 'moving-locus' scheme. However, gene reordering is only part of the Messy picture. The MGA uses another mechanism that is influential in enabling successful recombination. Specifically, the use of partial specification (or variable length genomes) allows the individuals themselves, rather than the ordering of genes within an individual, to represent which genes 'go together' during recombination. This paper examines this critical feature of the MGA and illustrates the impact that partial specification has on recombination. We formulate an Incremental Commitment GA that uses partially specified representations and recombination inspired by the MGA but separates these features from the moving-locus aspects and many of the other features of the existing algorithm.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Orlando, Florida, USA}, author = {Watson, Richard A. and Pollack, Jordan B.}, biburl = {https://www.bibsonomy.org/bibtex/218b44b3a96ccbd3ec1d6f3d4fcfa0049/brazovayeye}, booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference}, editor = {Banzhaf, Wolfgang and Daida, Jason and Eiben, Agoston E. and Garzon, Max H. and Honavar, Vasant and Jakiela, Mark and Smith, Robert E.}, interhash = {1e8b859103affaf48e9d1cd843136290}, intrahash = {18b44b3a96ccbd3ec1d6f3d4fcfa0049}, isbn = {1-55860-611-4}, keywords = {(H-IFF) Algorithms, Genetic Hierarchical-if-and-only-if Messy algorithms and classifier genetic systems,}, month = {13-17 July}, notes = {GECCO-99 A joint meeting of the eighth international conference on genetic algorithms (ICGA-99) and the fourth annual genetic programming conference (GP-99)}, pages = {710--717}, publisher = {Morgan Kaufmann}, publisher_address = {San Francisco, CA 94104, USA}, timestamp = {2008-06-19T17:53:56.000+0200}, title = {Incremental Commitment in Genetic Algorithms}, url = {http://www.cs.bham.ac.uk/~wbl/biblio/gecco1999/GA-887.ps}, volume = 1, year = 1999 }