Genetic and evolutionary algorithms, inspired by biological processes, provide a technique for programs to "automatically" improve their parameters. We discuss the basics of the algorithms and introduce our own hybrid. The development of this hybrid and its application to a simplified problem, evolving the coefficients for the sine function in a Taylor series, presents opportunities for computer science education with respect to model-building, data structures, and language features. Students must decide upon the representation of the chief mechanisms of genetic algorithms: mutation to alter the values of parameters directly and crossover to vary the groupings of co-evolved parameters in order to break away from local fitness maxima. They must examine the meaning of fitness itself as well as make many other modeling decisions. Ada itself provides both challenges and advantages: linked-lists must be well understood to be updated in an object-oriented context and hard-typing produces mixed reactions in students used to C++, but generics provide a powerful way to generalize the algorithm and incorporating different problem domains.
End of preview. The entire article is 8 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/developing-a-generic-genetic-algorithm-nJn9AzfTHm
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Developing a generic genetic algorithm
Neville, Melvin; Sibley, Anaika
Follow ACM SIGAda Ada Letters
, Volume XXIII (1)
Association for Computing Machinery – Mar 1, 2003
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
