{"id":{"repo_id":"must-thes","oai_identifier":"oai:scholarsmine.mst.edu:doctoral_dissertations-2761"},"canonical_url":"https://search.dev.ndltd.org/etd/must-thes/oai:scholarsmine.mst.edu:doctoral_dissertations-2761","repository":{"repo_id":"must-thes","name":"Missouri University of Science and Technology","base_url":"https://scholarsmine.mst.edu/do/oai/"},"display":{"title":"The art of parameterless evolutionary algorithms","abstract":"\"Evolutionary Algorithms (EAs) can be powerful problem solving tools when other methods fail. EAs maintain a collection of solutions and go through many iterations of recombining and randomly modifying current solutions, deleting some of the discovered solutions and giving the better solutions a higher chance of surviving. In such a manner EAs explore the search space in the pursuit of globally optimal solutions. To make an EA successful in its pursuit of globally optimal solutions on any particular problem, the evolutionary operators and relevant parameters must be carefully tuned. The tuning of operators and parameters is often manual and time consuming. The focus of this dissertation is on automatic tuning of operators and parameters. This dissertation presents methodologies for automating the tuning of the population size parameter and the choice of the mate selection operator\"--Abstract, page iii.","abstract_html":""Evolutionary Algorithms (EAs) can be powerful problem solving tools when other methods fail. EAs maintain a collection of solutions and go through many iterations of recombining and randomly modifying current solutions, deleting some of the discovered solutions and giving the better solutions a higher chance of surviving. In such a manner EAs explore the search space in the pursuit of globally optimal solutions. To make an EA successful in its pursuit of globally optimal solutions on any particular problem, the evolutionary operators and relevant parameters must be carefully tuned. The tuning of operators and parameters is often manual and time consuming. The focus of this dissertation is on automatic tuning of operators and parameters. This dissertation presents methodologies for automating the tuning of the population size parameter and the choice of the mate selection operator"--Abstract, page iii.","abstract_has_math":false,"creators":["Holdener, Ekaterina A."],"institution":"Missouri University of Science and Technology","degree_name":"Ph. D. in Computer Science","degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-02-10T08:00:00Z","date_published":"2016-02-10T08:00:00Z","updated_at":"2026-07-24T03:18:57Z","subjects":["Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://scholarsmine.mst.edu/doctoral_dissertations/1759","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Holdener, Ekaterina A."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2016-02-10T08:00:00Z"]},{"key":"dc:type","label":"Dc Type","values":["Dissertation - Citation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D. in Computer Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Missouri University of Science and Technology"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarsmine.mst.edu/doctoral_dissertations/1759"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["\"Evolutionary Algorithms (EAs) can be powerful problem solving tools when other methods fail. EAs maintain a collection of solutions and go through many iterations of recombining and randomly modifying current solutions, deleting some of the discovered solutions and giving the better solutions a higher chance of surviving. In such a manner EAs explore the search space in the pursuit of globally optimal solutions. To make an EA successful in its pursuit of globally optimal solutions on any particular problem, the evolutionary operators and relevant parameters must be carefully tuned. The tuning of operators and parameters is often manual and time consuming. The focus of this dissertation is on automatic tuning of operators and parameters. This dissertation presents methodologies for automating the tuning of the population size parameter and the choice of the mate selection operator\"--Abstract, page iii."]},{"key":"dc:title","label":"Title","values":["The art of parameterless evolutionary algorithms"]}]}],"canonical_facts":{"dc:creator":["Holdener, Ekaterina A."],"dc:date.available":["2016-02-10T08:00:00Z"],"dc:description.abstract":["\"Evolutionary Algorithms (EAs) can be powerful problem solving tools when other methods fail. EAs maintain a collection of solutions and go through many iterations of recombining and randomly modifying current solutions, deleting some of the discovered solutions and giving the better solutions a higher chance of surviving. In such a manner EAs explore the search space in the pursuit of globally optimal solutions. To make an EA successful in its pursuit of globally optimal solutions on any particular problem, the evolutionary operators and relevant parameters must be carefully tuned. The tuning of operators and parameters is often manual and time consuming. The focus of this dissertation is on automatic tuning of operators and parameters. This dissertation presents methodologies for automating the tuning of the population size parameter and the choice of the mate selection operator\"--Abstract, page iii."],"dc:identifier":["https://scholarsmine.mst.edu/doctoral_dissertations/1759"],"dc:subject":["Computer Sciences"],"dc:title":["The art of parameterless evolutionary algorithms"],"dc:type":["Dissertation - Citation"],"thesis:degree_name":["Ph. D. in Computer Science"],"thesis:institution_name":["Missouri University of Science and Technology"]},"updated_at":"2026-07-24T03:18:57Z"}