{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:8895"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:8895","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Dynamic multi-objective optimization: a two archive strategy","abstract":"Existing studies on dynamic multi-objective optimization mainly focus on dynamic problems with time-dependent objective functions. Few works have put efforts on dynamic problems with a changing number of objectives, or dynamic problems with time-dependent constraints. When problems have time-dependent objective functions, the shape or position of the Pareto-optimal front/set may change over time. However, when dealing with problems with a changing objective number or time-dependent constraints, the challenges are different. Changing number of objectives leads to the expansion or contraction of the dimensions of the Pareto-optimal front/set manifold, while time-dependent constraints may change the shape of feasible regions over time. The existing dynamic handling techniques can hardly handle the changing number of objectives. The state-of-arts in constraints handling techniques are incapable of tackling problems with time-dependent constraints. In this thesis, we present our attempts toward tackling 1) the dynamic multiobjective optimizing problems with a changing number of objectives and 2) multi-objective optimizing problems with time-dependent constraints. Two-archive Evolutionary Algorithms are proposed. Comprehensive experiments are conducted on various benchmark problems for both types of dynamics. Empirical results fully demonstrate the effectiveness of our proposed algorithms.","abstract_html":"Existing studies on dynamic multi-objective optimization mainly focus on dynamic problems with time-dependent objective functions. Few works have put efforts on dynamic problems with a changing number of objectives, or dynamic problems with time-dependent constraints. When problems have time-dependent objective functions, the shape or position of the Pareto-optimal front/set may change over time. However, when dealing with problems with a changing objective number or time-dependent constraints, the challenges are different. Changing number of objectives leads to the expansion or contraction of the dimensions of the Pareto-optimal front/set manifold, while time-dependent constraints may change the shape of feasible regions over time. The existing dynamic handling techniques can hardly handle the changing number of objectives. The state-of-arts in constraints handling techniques are incapable of tackling problems with time-dependent constraints. In this thesis, we present our attempts toward tackling 1) the dynamic multiobjective optimizing problems with a changing number of objectives and 2) multi-objective optimizing problems with time-dependent constraints. Two-archive Evolutionary Algorithms are proposed. Comprehensive experiments are conducted on various benchmark problems for both types of dynamics. Empirical results fully demonstrate the effectiveness of our proposed algorithms.","abstract_has_math":false,"creators":["Chen, Renzhi"],"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":2018,"date_issued":"2018-12","date_published":"2018-12","updated_at":"2026-11-19T09:30:24Z","subjects":["TK Electrical engineering. Electronics Nuclear engineering"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"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/8895/1/Chen18PhD.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%3A8895","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["na"]},{"key":"dc:creator","label":"Author","values":["Chen, Renzhi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2018-12"]},{"key":"dc:date.issued","label":"Date","values":["2018-12"]},{"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/8895/"]},{"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":["TK Electrical engineering. Electronics Nuclear engineering"]}]},{"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/8895/1/Chen18PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Existing studies on dynamic multi-objective optimization mainly focus on dynamic problems with time-dependent objective functions. Few works have put efforts on dynamic problems with a changing number of objectives, or dynamic problems with time-dependent constraints. When problems have time-dependent objective functions, the shape or position of the Pareto-optimal front/set may change over time. However, when dealing with problems with a changing objective number or time-dependent constraints, the challenges are different. Changing number of objectives leads to the expansion or contraction of the dimensions of the Pareto-optimal front/set manifold, while time-dependent constraints may change the shape of feasible regions over time. The existing dynamic handling techniques can hardly handle the changing number of objectives. The state-of-arts in constraints handling techniques are incapable of tackling problems with time-dependent constraints. In this thesis, we present our attempts toward tackling 1) the dynamic multiobjective optimizing problems with a changing number of objectives and 2) multi-objective optimizing problems with time-dependent constraints. Two-archive Evolutionary Algorithms are proposed. Comprehensive experiments are conducted on various benchmark problems for both types of dynamics. Empirical results fully demonstrate the effectiveness of our proposed algorithms."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Dynamic multi-objective optimization: a two archive strategy"]}]}],"canonical_facts":{"dc:contributor.sponsor":["na"],"dc:creator":["Chen, Renzhi"],"dc:date":["2018-12"],"dc:date.issued":["2018-12"],"dc:description.abstract":["Existing studies on dynamic multi-objective optimization mainly focus on dynamic problems with time-dependent objective functions. Few works have put efforts on dynamic problems with a changing number of objectives, or dynamic problems with time-dependent constraints. When problems have time-dependent objective functions, the shape or position of the Pareto-optimal front/set may change over time. However, when dealing with problems with a changing objective number or time-dependent constraints, the challenges are different. Changing number of objectives leads to the expansion or contraction of the dimensions of the Pareto-optimal front/set manifold, while time-dependent constraints may change the shape of feasible regions over time. The existing dynamic handling techniques can hardly handle the changing number of objectives. The state-of-arts in constraints handling techniques are incapable of tackling problems with time-dependent constraints. In this thesis, we present our attempts toward tackling 1) the dynamic multiobjective optimizing problems with a changing number of objectives and 2) multi-objective optimizing problems with time-dependent constraints. Two-archive Evolutionary Algorithms are proposed. Comprehensive experiments are conducted on various benchmark problems for both types of dynamics. Empirical results fully demonstrate the effectiveness of our proposed algorithms."],"dc:format":["text"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/8895/1/Chen18PhD.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/8895/"],"dc:subject":["TK Electrical engineering. Electronics Nuclear engineering"],"dcterms:accessrights":["public"],"dc:title":["Dynamic multi-objective optimization: a two archive strategy"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:30:24Z"}