{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81895"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81895","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"The Nature of Niching: Genetic Algorithms and the Evolution of Optimal, Cooperative Populations","abstract":"We extend the above analysis by looking at some aspects of the general case of multiple overlapping niches. We discover that calculating the equilibrium point for three or more niches under resource sharing can be computationally expensive, as evidenced by the difficulty that GA selection has in reaching it. We present some evidence that equilibrium can thus represent solutions to hard problems, and that selection plus sharing might be a computationally intensive yet efficient algorithm (even without the exploration operators of recombination and mutation). (Abstract shortened by UMI.).","abstract_html":"We extend the above analysis by looking at some aspects of the general case of multiple overlapping niches. We discover that calculating the equilibrium point for three or more niches under resource sharing can be computationally expensive, as evidenced by the difficulty that GA selection has in reaching it. We present some evidence that equilibrium can thus represent solutions to hard problems, and that selection plus sharing might be a computationally intensive yet efficient algorithm (even without the exploration operators of recombination and mutation). (Abstract shortened by UMI.).","abstract_has_math":false,"creators":["Horn, Jeffrey"],"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, D.E."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:20:54Z","date_published":"2015-09-25T20:20:54Z","updated_at":"2026-07-22T22:26:17Z","subjects":["Biology, Ecology"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI9812622"],"render_values":[{"text":"(MiAaPQ)AAI9812622","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81895","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Goldberg, D.E."]},{"key":"dc:creator","label":"Author","values":["Horn, Jeffrey"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:20:54Z","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":["Biology, Ecology"]}]},{"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/81895","(MiAaPQ)AAI9812622"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We extend the above analysis by looking at some aspects of the general case of multiple overlapping niches. We discover that calculating the equilibrium point for three or more niches under resource sharing can be computationally expensive, as evidenced by the difficulty that GA selection has in reaching it. We present some evidence that equilibrium can thus represent solutions to hard problems, and that selection plus sharing might be a computationally intensive yet efficient algorithm (even without the exploration operators of recombination and mutation). (Abstract shortened by UMI.).","Made available in DSpace on 2015-09-25T20:20:54Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9812622.pdf: 12917974 bytes, checksum: 821b895dd33eaee58237564350ca064a (MD5) Previous issue date: 1997","Embargo set by: Seth Robbins for item 83176 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","242 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997."]},{"key":"dc:title","label":"Title","values":["The Nature of Niching: Genetic Algorithms and the Evolution of Optimal, Cooperative Populations"]}]}],"canonical_facts":{"dc:contributor":["Goldberg, D.E."],"dc:creator":["Horn, Jeffrey"],"dc:date":["2015-09-25T20:20:54Z","10000-01-01","1997"],"dc:description":["We extend the above analysis by looking at some aspects of the general case of multiple overlapping niches. We discover that calculating the equilibrium point for three or more niches under resource sharing can be computationally expensive, as evidenced by the difficulty that GA selection has in reaching it. We present some evidence that equilibrium can thus represent solutions to hard problems, and that selection plus sharing might be a computationally intensive yet efficient algorithm (even without the exploration operators of recombination and mutation). (Abstract shortened by UMI.).","Made available in DSpace on 2015-09-25T20:20:54Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9812622.pdf: 12917974 bytes, checksum: 821b895dd33eaee58237564350ca064a (MD5) Previous issue date: 1997","Embargo set by: Seth Robbins for item 83176 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","242 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997."],"dc:identifier":["http://hdl.handle.net/2142/81895","(MiAaPQ)AAI9812622"],"dc:language":["eng"],"dc:subject":["Biology, Ecology"],"dc:title":["The Nature of Niching: Genetic Algorithms and the Evolution of Optimal, Cooperative Populations"],"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"}