{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:14436"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:14436","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Self-adaptive parameter control mechanisms in evolutionary computation","abstract":"Evolutionary algorithms (EAs) are effective solvers for a variety of discrete black-box optimisation problems. However, their performance heavily relies on the proper selection of algorithmic parameters, such as mutation rate, crossover rate, and selection pressure, which are often problem- and instance-specific. One promising approach is self-adaptive parameter control mechanisms, where the parameters are encoded in the individuals and evolved along with their solutions through variation operators. Although there have been some theoretical studies demonstrating the efficiency of self-adaptive EAs on certain functions with unknown structure, the potential benefits of this approach in other scenarios remain unknown. Moreover, there is a great opportunity for creativity in designing elegant self-adaptive EAs. In this thesis, we first examine the benefits of self-adaptation in noisy optimisation, where the presence of noise can significantly affect the algorithm performance. We provide a mathematical analysis of the runtime of 2-tournament EAs with self-adapting mutation rates and two other parameter strategies on a theoretical benchmark optimisation problem with and without symmetric noise. Our results demonstrate that self-adaptation consistently achieves the lowest runtime compared to using fixed mutation rates. This is confirmed regardless of the presence of noise, through additional experiments with other noise types and self-adaptation mechanisms. Next, we investigate the performance of self-adaptive EAs on a natural tracking dynamic optima problem, known as the Dynamic Substring Matching (DSM) problem. This problem requires the algorithm to track a sequence of structure-changing optima, and our analysis reveals that mutation-based EAs with a fixed mutation rate have small chance of succeeding, while self-adaptive EAs can track the dynamic optima with high probability. Finally, we propose a novel self-adaptive EA for single-objective optimisation, which incorporates multi-objective optimisation principles to jointly optimise the fitness and mutation rates. We call this algorithm multi-objective self-adaptive EA (MOSA- EA). Our runtime analysis shows that the MOSA-EA can efficiently escape the local optima with unknown sparsity, where fixed mutation rate EAs may become trapped. In an empirical study on complex combinatorial problems, the MOSA-EA outperforms twelve other algorithms on NK-Landscape and Max-k-Sat problem instances. Overall, this thesis suggests that the self-adaptation has great potential for controlling parameters in EAs, especially in challenging optimisation scenarios, such as uncertain optimisation.","abstract_html":"Evolutionary algorithms (EAs) are effective solvers for a variety of discrete black-box optimisation problems. However, their performance heavily relies on the proper selection of algorithmic parameters, such as mutation rate, crossover rate, and selection pressure, which are often problem- and instance-specific. One promising approach is self-adaptive parameter control mechanisms, where the parameters are encoded in the individuals and evolved along with their solutions through variation operators. Although there have been some theoretical studies demonstrating the efficiency of self-adaptive EAs on certain functions with unknown structure, the potential benefits of this approach in other scenarios remain unknown. Moreover, there is a great opportunity for creativity in designing elegant self-adaptive EAs. In this thesis, we first examine the benefits of self-adaptation in noisy optimisation, where the presence of noise can significantly affect the algorithm performance. We provide a mathematical analysis of the runtime of 2-tournament EAs with self-adapting mutation rates and two other parameter strategies on a theoretical benchmark optimisation problem with and without symmetric noise. Our results demonstrate that self-adaptation consistently achieves the lowest runtime compared to using fixed mutation rates. This is confirmed regardless of the presence of noise, through additional experiments with other noise types and self-adaptation mechanisms. Next, we investigate the performance of self-adaptive EAs on a natural tracking dynamic optima problem, known as the Dynamic Substring Matching (DSM) problem. This problem requires the algorithm to track a sequence of structure-changing optima, and our analysis reveals that mutation-based EAs with a fixed mutation rate have small chance of succeeding, while self-adaptive EAs can track the dynamic optima with high probability. Finally, we propose a novel self-adaptive EA for single-objective optimisation, which incorporates multi-objective optimisation principles to jointly optimise the fitness and mutation rates. We call this algorithm multi-objective self-adaptive EA (MOSA- EA). Our runtime analysis shows that the MOSA-EA can efficiently escape the local optima with unknown sparsity, where fixed mutation rate EAs may become trapped. In an empirical study on complex combinatorial problems, the MOSA-EA outperforms twelve other algorithms on NK-Landscape and Max-k-Sat problem instances. Overall, this thesis suggests that the self-adaptation has great potential for controlling parameters in EAs, especially in challenging optimisation scenarios, such as uncertain optimisation.","abstract_has_math":false,"creators":["Qin, Xiaoyu"],"institution":"University of Birmingham","degree_name":"d_ph","degree_level":"d_ph","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-07","date_published":"2024-07","updated_at":"2026-11-19T09:32:36Z","subjects":["QA Mathematics","QA75 Electronic computers. Computer science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[{"key":"person:identifier.orcid","label":"ORCID","values":["0000000297203220"],"render_values":[{"text":"0000-0002-9720-3220","href":"https://orcid.org/0000-0002-9720-3220","code":true}]}]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"http://etheses.bham.ac.uk//id/eprint/14436/7/Qin2024PhD.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://etheses.bham.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Aetheses.bham.ac.uk%3A14436","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["na"]},{"key":"dc:creator","label":"Author","values":["Qin, Xiaoyu"]},{"key":"person:identifier.orcid","label":"ORCID","values":["0000000297203220"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2024-07-11"]},{"key":"dc:date.issued","label":"Date","values":["2024-07"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["College of Engineering & Physical Sciences","School of Computer Science"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Birmingham"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["http://etheses.bham.ac.uk//id/eprint/14436/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["d_ph"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["d_ph"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QA Mathematics","QA75 Electronic computers. Computer science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.dcterms_iso639_2","label":"Language (ISO 639-2)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://etheses.bham.ac.uk//id/eprint/14436/7/Qin2024PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Evolutionary algorithms (EAs) are effective solvers for a variety of discrete black-box optimisation problems. However, their performance heavily relies on the proper selection of algorithmic parameters, such as mutation rate, crossover rate, and selection pressure, which are often problem- and instance-specific. One promising approach is self-adaptive parameter control mechanisms, where the parameters are encoded in the individuals and evolved along with their solutions through variation operators. Although there have been some theoretical studies demonstrating the efficiency of self-adaptive EAs on certain functions with unknown structure, the potential benefits of this approach in other scenarios remain unknown. Moreover, there is a great opportunity for creativity in designing elegant self-adaptive EAs. In this thesis, we first examine the benefits of self-adaptation in noisy optimisation, where the presence of noise can significantly affect the algorithm performance. We provide a mathematical analysis of the runtime of 2-tournament EAs with self-adapting mutation rates and two other parameter strategies on a theoretical benchmark optimisation problem with and without symmetric noise. Our results demonstrate that self-adaptation consistently achieves the lowest runtime compared to using fixed mutation rates. This is confirmed regardless of the presence of noise, through additional experiments with other noise types and self-adaptation mechanisms. Next, we investigate the performance of self-adaptive EAs on a natural tracking dynamic optima problem, known as the Dynamic Substring Matching (DSM) problem. This problem requires the algorithm to track a sequence of structure-changing optima, and our analysis reveals that mutation-based EAs with a fixed mutation rate have small chance of succeeding, while self-adaptive EAs can track the dynamic optima with high probability. Finally, we propose a novel self-adaptive EA for single-objective optimisation, which incorporates multi-objective optimisation principles to jointly optimise the fitness and mutation rates. We call this algorithm multi-objective self-adaptive EA (MOSA- EA). Our runtime analysis shows that the MOSA-EA can efficiently escape the local optima with unknown sparsity, where fixed mutation rate EAs may become trapped. In an empirical study on complex combinatorial problems, the MOSA-EA outperforms twelve other algorithms on NK-Landscape and Max-k-Sat problem instances. Overall, this thesis suggests that the self-adaptation has great potential for controlling parameters in EAs, especially in challenging optimisation scenarios, such as uncertain optimisation."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Self-adaptive parameter control mechanisms in evolutionary computation"]}]}],"canonical_facts":{"dc:contributor.sponsor":["na"],"dc:creator":["Qin, Xiaoyu"],"dc:date":["2024-07-11"],"dc:date.issued":["2024-07"],"dc:description.abstract":["Evolutionary algorithms (EAs) are effective solvers for a variety of discrete black-box optimisation problems. However, their performance heavily relies on the proper selection of algorithmic parameters, such as mutation rate, crossover rate, and selection pressure, which are often problem- and instance-specific. One promising approach is self-adaptive parameter control mechanisms, where the parameters are encoded in the individuals and evolved along with their solutions through variation operators. Although there have been some theoretical studies demonstrating the efficiency of self-adaptive EAs on certain functions with unknown structure, the potential benefits of this approach in other scenarios remain unknown. Moreover, there is a great opportunity for creativity in designing elegant self-adaptive EAs. In this thesis, we first examine the benefits of self-adaptation in noisy optimisation, where the presence of noise can significantly affect the algorithm performance. We provide a mathematical analysis of the runtime of 2-tournament EAs with self-adapting mutation rates and two other parameter strategies on a theoretical benchmark optimisation problem with and without symmetric noise. Our results demonstrate that self-adaptation consistently achieves the lowest runtime compared to using fixed mutation rates. This is confirmed regardless of the presence of noise, through additional experiments with other noise types and self-adaptation mechanisms. Next, we investigate the performance of self-adaptive EAs on a natural tracking dynamic optima problem, known as the Dynamic Substring Matching (DSM) problem. This problem requires the algorithm to track a sequence of structure-changing optima, and our analysis reveals that mutation-based EAs with a fixed mutation rate have small chance of succeeding, while self-adaptive EAs can track the dynamic optima with high probability. Finally, we propose a novel self-adaptive EA for single-objective optimisation, which incorporates multi-objective optimisation principles to jointly optimise the fitness and mutation rates. We call this algorithm multi-objective self-adaptive EA (MOSA- EA). Our runtime analysis shows that the MOSA-EA can efficiently escape the local optima with unknown sparsity, where fixed mutation rate EAs may become trapped. In an empirical study on complex combinatorial problems, the MOSA-EA outperforms twelve other algorithms on NK-Landscape and Max-k-Sat problem instances. Overall, this thesis suggests that the self-adaptation has great potential for controlling parameters in EAs, especially in challenging optimisation scenarios, such as uncertain optimisation."],"dc:format":["text"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/14436/7/Qin2024PhD.pdf"],"dc:language.dcterms_iso639_2":["eng"],"dc:publisher.department":["College of Engineering & Physical Sciences","School of Computer Science"],"dc:publisher.institution":["University of Birmingham"],"dc:relation.isreferencedby":["http://etheses.bham.ac.uk//id/eprint/14436/"],"dc:subject":["QA Mathematics","QA75 Electronic computers. Computer science"],"dcterms:accessrights":["public"],"dc:title":["Self-adaptive parameter control mechanisms in evolutionary computation"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"],"person:identifier.orcid":["0000000297203220"]},"updated_at":"2026-11-19T09:32:36Z"}