{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81884"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81884","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Noise, Sampling, and Efficient Genetic Algorithms","abstract":"As genetic algorithms (GA) move into industry, a thorough understanding of how GAs are affected by noise is becoming increasingly important. Noise affects a GA's population sizing requirements, performance characteristics, and computational requirements. This research develops quantitative models for determining the effects of noise on the operation of a GA. Furthermore, the question of how to best optimize the performance of a GA in a noisy environments is investigated. Sampling fitness functions are explored, and techniques for determining the optimal sample size that maximizes the performance of a GA within a fixed computational time bound are presented.","abstract_html":"As genetic algorithms (GA) move into industry, a thorough understanding of how GAs are affected by noise is becoming increasingly important. Noise affects a GA's population sizing requirements, performance characteristics, and computational requirements. This research develops quantitative models for determining the effects of noise on the operation of a GA. Furthermore, the question of how to best optimize the performance of a GA in a noisy environments is investigated. Sampling fitness functions are explored, and techniques for determining the optimal sample size that maximizes the performance of a GA within a fixed computational time bound are presented.","abstract_has_math":false,"creators":["Miller, Brad L."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Goldberg, David E."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:20:51Z","date_published":"2015-09-25T20:20:51Z","updated_at":"2026-07-22T22:26:17Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI9737200"],"render_values":[{"text":"(MiAaPQ)AAI9737200","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81884","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Goldberg, David E."]},{"key":"dc:creator","label":"Author","values":["Miller, Brad L."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:20:51Z","10000-01-01","1997"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81884","(MiAaPQ)AAI9737200"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["As genetic algorithms (GA) move into industry, a thorough understanding of how GAs are affected by noise is becoming increasingly important. Noise affects a GA's population sizing requirements, performance characteristics, and computational requirements. This research develops quantitative models for determining the effects of noise on the operation of a GA. Furthermore, the question of how to best optimize the performance of a GA in a noisy environments is investigated. Sampling fitness functions are explored, and techniques for determining the optimal sample size that maximizes the performance of a GA within a fixed computational time bound are presented.","Made available in DSpace on 2015-09-25T20:20:51Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9737200.pdf: 4007637 bytes, checksum: 358ba13e45362009fc3ec2d5ba475ff2 (MD5) Previous issue date: 1997","Embargo set by: Seth Robbins for item 83165 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","157 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997."]},{"key":"dc:title","label":"Title","values":["Noise, Sampling, and Efficient Genetic Algorithms"]}]}],"canonical_facts":{"dc:contributor":["Goldberg, David E."],"dc:creator":["Miller, Brad L."],"dc:date":["2015-09-25T20:20:51Z","10000-01-01","1997"],"dc:description":["As genetic algorithms (GA) move into industry, a thorough understanding of how GAs are affected by noise is becoming increasingly important. Noise affects a GA's population sizing requirements, performance characteristics, and computational requirements. This research develops quantitative models for determining the effects of noise on the operation of a GA. Furthermore, the question of how to best optimize the performance of a GA in a noisy environments is investigated. Sampling fitness functions are explored, and techniques for determining the optimal sample size that maximizes the performance of a GA within a fixed computational time bound are presented.","Made available in DSpace on 2015-09-25T20:20:51Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9737200.pdf: 4007637 bytes, checksum: 358ba13e45362009fc3ec2d5ba475ff2 (MD5) Previous issue date: 1997","Embargo set by: Seth Robbins for item 83165 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","157 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997."],"dc:identifier":["http://hdl.handle.net/2142/81884","(MiAaPQ)AAI9737200"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Noise, Sampling, and Efficient Genetic Algorithms"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:17Z"}