{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_52916"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_52916","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"Handling of Objectives and Constraints with Heterogeneous Evaluation Times in Surrogate-Assisted Evolutionary Multi-Objective Optimization","abstract":"Thesis (Ph.D.)--Michigan State University. Mechanical Engineering - Doctor of Philosophy, 2026","abstract_html":"Thesis (Ph.D.)--Michigan State University. Mechanical Engineering - Doctor of Philosophy, 2026","abstract_has_math":false,"creators":["Santoshkumar, Balija"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Deb, Kalyanmoy"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-18T18:59:31Z","subjects":["Computer science","Mechanical engineering","Engineering"],"languages":["eng"],"rights":["Attribution-NonCommercial 4.0 International"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:52916","local:Santoshkumar_grad.msu_0128D_21914"],"render_values":[{"text":"etd:52916","href":null,"code":true},{"text":"local:Santoshkumar_grad.msu_0128D_21914","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/doi:10.25335/3ae5-t975","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/doi:10.25335/3ae5-t975","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_52916","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Deb, Kalyanmoy"]},{"key":"dc:creator","label":"Author","values":["Santoshkumar, Balija"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2026"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["text","Electronic dissertations"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer science","Mechanical engineering","Engineering"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution-NonCommercial 4.0 International"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:52916","local:Santoshkumar_grad.msu_0128D_21914","https://doi.org/doi:10.25335/3ae5-t975"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph.D.)--Michigan State University. Mechanical Engineering - Doctor of Philosophy, 2026","Most practical optimization problems involve expensive evaluation procedures for computing objective and constraint functions. To obtain reasonable and accurate solutions close to true Pareto-optimal solutions, evolutionary multi-objective optimization (EMO) algorithms create surrogate models from already-evaluated high-fidelity solutions and use them during optimization to save computational time. However, most surrogate-assisted EMO algorithms are designed to evaluate all objectives and constraints of a solution if found worthy of a high-fidelity evaluation. Such algorithms are inefficient if objectives and constraints involve heterogeneity with orders of magnitude of difference in evaluation times. Clearly, functions with relatively small evaluation time can be high-fidelity evaluated more often to obtain an overall idea of the potential importance of the solution before deciding to spend more time on evaluating expensive functions.To address this inefficiency, this work presents a series of innovative advancements designed toward more computationally efficient surrogate-assisted EMO/EMaO algorithms by leveraging mixed-fidelity heterogeneous evaluation strategies, wherein some objectives and constraints of a population member are evaluated using a high-fidelity model, and others evaluated using a low-fidelity model. Recent studies show that such selective evaluations can be more efficient because the time saved by not evaluating constraint functions for largely infeasible or largely feasible solutions, and objective functions for largely infeasible solutions can be utilized to evaluate potential solutions near the constraint boundaries and feasible regions, respectively.In pursuit of this goal, the first contribution introduces a heterogeneous EMO (HET-EMO) framework that incorporates a probabilistic ranking procedure for determining which population member and which objective functions are to be high-fidelity evaluated so that they would produce the best chance of improving convergence and diversity preservation within an EMO/EMaO generation. The ranking metric uses three properties of a population member: (i) relative evaluation times, (ii) the probability of the member being non-dominated in its neighborhood, and (iii) each objective's surrogate prediction error. Details of the resulting heterogeneous EMO (HET-EMO) algorithm are presented with pseudo-codes, sketches, and discussions. Thereafter, results of HET-EMO are compared with four state-of-the-art surrogate-assisted EMOs, including the one that handles heterogeneity in evaluation times and an original EMO (without any surrogate) on a total of 234 test and engineering problem instances having two to eight objectives. Results indicate superior performance of HET-EMO, indicating the effectiveness of the proposed procedure. Building on HET-EMO, the second contribution explores an independent and mixed-fidelity evaluation approach (MFE-EMO) that carefully determines which constraints and objectives should be high-fidelity evaluated for every population member and suggests a mixed-fidelity survival selection procedure capable of working with low- and high-fidelity evaluated population members. Results on a number of test and engineering problems indicate the viability of such a constrained multi- and many-objective optimization.Finally, the proposed MFE-EMO framework is applied to a real-world case study on electric motor design optimization, demonstrating its effectiveness in solving practical engineering optimization problems.Collectively, these contributions advocate a paradigm shift in surrogate-assisted evolutionary optimization from all-function evaluation toward heterogeneity-aware, selectively evaluated, and computationally efficient EMO/EMaO algorithms. The findings also raise several future research directions demonstrating the need and motivation for further studies on the topic.","Description based on online resource. Title from PDF t.p. (Michigan State University Fedora Repository, viewed ).","Includes bibliographical references."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf","1 online resource (127 p.) : ill."]},{"key":"dc:title","label":"Title","values":["Handling of Objectives and Constraints with Heterogeneous Evaluation Times in Surrogate-Assisted Evolutionary Multi-Objective Optimization"]}]}],"canonical_facts":{"dc:contributor":["Deb, Kalyanmoy"],"dc:creator":["Santoshkumar, Balija"],"dc:date":["2026"],"dc:description":["Thesis (Ph.D.)--Michigan State University. Mechanical Engineering - Doctor of Philosophy, 2026","Most practical optimization problems involve expensive evaluation procedures for computing objective and constraint functions. To obtain reasonable and accurate solutions close to true Pareto-optimal solutions, evolutionary multi-objective optimization (EMO) algorithms create surrogate models from already-evaluated high-fidelity solutions and use them during optimization to save computational time. However, most surrogate-assisted EMO algorithms are designed to evaluate all objectives and constraints of a solution if found worthy of a high-fidelity evaluation. Such algorithms are inefficient if objectives and constraints involve heterogeneity with orders of magnitude of difference in evaluation times. Clearly, functions with relatively small evaluation time can be high-fidelity evaluated more often to obtain an overall idea of the potential importance of the solution before deciding to spend more time on evaluating expensive functions.To address this inefficiency, this work presents a series of innovative advancements designed toward more computationally efficient surrogate-assisted EMO/EMaO algorithms by leveraging mixed-fidelity heterogeneous evaluation strategies, wherein some objectives and constraints of a population member are evaluated using a high-fidelity model, and others evaluated using a low-fidelity model. Recent studies show that such selective evaluations can be more efficient because the time saved by not evaluating constraint functions for largely infeasible or largely feasible solutions, and objective functions for largely infeasible solutions can be utilized to evaluate potential solutions near the constraint boundaries and feasible regions, respectively.In pursuit of this goal, the first contribution introduces a heterogeneous EMO (HET-EMO) framework that incorporates a probabilistic ranking procedure for determining which population member and which objective functions are to be high-fidelity evaluated so that they would produce the best chance of improving convergence and diversity preservation within an EMO/EMaO generation. The ranking metric uses three properties of a population member: (i) relative evaluation times, (ii) the probability of the member being non-dominated in its neighborhood, and (iii) each objective's surrogate prediction error. Details of the resulting heterogeneous EMO (HET-EMO) algorithm are presented with pseudo-codes, sketches, and discussions. Thereafter, results of HET-EMO are compared with four state-of-the-art surrogate-assisted EMOs, including the one that handles heterogeneity in evaluation times and an original EMO (without any surrogate) on a total of 234 test and engineering problem instances having two to eight objectives. Results indicate superior performance of HET-EMO, indicating the effectiveness of the proposed procedure. Building on HET-EMO, the second contribution explores an independent and mixed-fidelity evaluation approach (MFE-EMO) that carefully determines which constraints and objectives should be high-fidelity evaluated for every population member and suggests a mixed-fidelity survival selection procedure capable of working with low- and high-fidelity evaluated population members. Results on a number of test and engineering problems indicate the viability of such a constrained multi- and many-objective optimization.Finally, the proposed MFE-EMO framework is applied to a real-world case study on electric motor design optimization, demonstrating its effectiveness in solving practical engineering optimization problems.Collectively, these contributions advocate a paradigm shift in surrogate-assisted evolutionary optimization from all-function evaluation toward heterogeneity-aware, selectively evaluated, and computationally efficient EMO/EMaO algorithms. The findings also raise several future research directions demonstrating the need and motivation for further studies on the topic.","Description based on online resource. Title from PDF t.p. (Michigan State University Fedora Repository, viewed ).","Includes bibliographical references."],"dc:format":["application/pdf","1 online resource (127 p.) : ill."],"dc:identifier":["etd:52916","local:Santoshkumar_grad.msu_0128D_21914","https://doi.org/doi:10.25335/3ae5-t975"],"dc:language":["eng"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["Attribution-NonCommercial 4.0 International"],"dc:subject":["Computer science","Mechanical engineering","Engineering"],"dc:title":["Handling of Objectives and Constraints with Heterogeneous Evaluation Times in Surrogate-Assisted Evolutionary Multi-Objective Optimization"],"dc:type":["text","Electronic dissertations"]},"updated_at":"2026-11-18T18:59:31Z"}