{"id":"https://openalex.org/W3127245979","doi":"https://doi.org/10.1115/1.4049996","title":"An Efficient Multi-Objective Robust Optimization Method by Sequentially Searching From Nominal Pareto Solutions","display_name":"An Efficient Multi-Objective Robust Optimization Method by Sequentially Searching From Nominal Pareto Solutions","publication_year":2021,"publication_date":"2021-01-29","ids":{"openalex":"https://openalex.org/W3127245979","doi":"https://doi.org/10.1115/1.4049996","mag":"3127245979"},"language":"en","primary_location":{"id":"doi:10.1115/1.4049996","is_oa":false,"landing_page_url":"https://doi.org/10.1115/1.4049996","pdf_url":null,"source":{"id":"https://openalex.org/S173178594","display_name":"Journal of Computing and Information Science in Engineering","issn_l":"1530-9827","issn":["1530-9827","1944-7078"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316053","host_organization_name":"ASM International","host_organization_lineage":["https://openalex.org/P4310316053"],"host_organization_lineage_names":["ASM International"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computing and Information Science in Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036519057","display_name":"Tingting Xia","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tingting Xia","raw_affiliation_strings":["University of Michigan- Shanghai Jiao Tong University Joint Institute, Shanghai Jiao Tong University, Shanghai 200240, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan- Shanghai Jiao Tong University Joint Institute, Shanghai Jiao Tong University, Shanghai 200240, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100756882","display_name":"Mian Li","orcid":"https://orcid.org/0000-0001-5184-5861"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mian Li","raw_affiliation_strings":["Department of Automation, Shanghai Jiao Tong University, Shanghai 200240, China","University of Michigan- Shanghai Jiao Tong University Joint Institute, Shanghai Jiao Tong University, Shanghai 200240, China;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Automation, Shanghai Jiao Tong University, Shanghai 200240, China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"University of Michigan- Shanghai Jiao Tong University Joint Institute, Shanghai Jiao Tong University, Shanghai 200240, China;","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":0.5791,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.69594394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11798","display_name":"Optimal Experimental Design Methods","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.7292897701263428},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.7251725792884827},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7074173092842102},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7058212757110596},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5905320048332214},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5518515706062317},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.5336884260177612},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44846850633621216},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38964587450027466},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09644675254821777}],"concepts":[{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.7292897701263428},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.7251725792884827},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7074173092842102},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7058212757110596},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5905320048332214},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5518515706062317},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.5336884260177612},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44846850633621216},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38964587450027466},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09644675254821777},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1115/1.4049996","is_oa":false,"landing_page_url":"https://doi.org/10.1115/1.4049996","pdf_url":null,"source":{"id":"https://openalex.org/S173178594","display_name":"Journal of Computing and Information Science in Engineering","issn_l":"1530-9827","issn":["1530-9827","1944-7078"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316053","host_organization_name":"ASM International","host_organization_lineage":["https://openalex.org/P4310316053"],"host_organization_lineage_names":["ASM International"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computing and Information Science in Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W267844665","https://openalex.org/W603163431","https://openalex.org/W1595498733","https://openalex.org/W1842733265","https://openalex.org/W1970858426","https://openalex.org/W1971188545","https://openalex.org/W1981547861","https://openalex.org/W1984877903","https://openalex.org/W1988459821","https://openalex.org/W2006675862","https://openalex.org/W2021718677","https://openalex.org/W2029266590","https://openalex.org/W2055708947","https://openalex.org/W2059249659","https://openalex.org/W2059385926","https://openalex.org/W2083466280","https://openalex.org/W2095259258","https://openalex.org/W2096258287","https://openalex.org/W2118089738","https://openalex.org/W2126105956","https://openalex.org/W2136602369","https://openalex.org/W2166364496","https://openalex.org/W2170440811","https://openalex.org/W2171012004","https://openalex.org/W2182144464","https://openalex.org/W2224788296","https://openalex.org/W2463080496","https://openalex.org/W2482318024","https://openalex.org/W2593312644","https://openalex.org/W2809944280","https://openalex.org/W2810007872","https://openalex.org/W2811189548","https://openalex.org/W4252436564","https://openalex.org/W6658044865","https://openalex.org/W6674703411","https://openalex.org/W6680241522"],"related_works":["https://openalex.org/W2402393579","https://openalex.org/W2090178682","https://openalex.org/W4241467429","https://openalex.org/W2073147994","https://openalex.org/W2001591765","https://openalex.org/W2384474142","https://openalex.org/W3083133203","https://openalex.org/W3149055374","https://openalex.org/W1588199609","https://openalex.org/W2216231335"],"abstract_inverted_index":{"Abstract":[0],"Multi-objective":[1],"optimization":[2,19,24,100,105,131,172,218],"problems":[3],"(MOOPs)":[4],"with":[5,22,51,91,222,225],"uncertainties":[6,92],"are":[7,93,106,120,214,231],"common":[8],"in":[9,37,95,108,147,177,216],"engineering":[10],"design.":[11],"To":[12],"find":[13,136],"robust":[14,18,40,59,80,130,138],"Pareto":[15,41,48,69,81,87,114,139,145,153],"fronts,":[16],"multi-objective":[17,205],"(MORO)":[20],"methods":[21],"inner\u2013outer":[23],"structures":[25],"usually":[26],"have":[27],"high":[28],"computational":[29,168,197],"complexity,":[30],"which":[31,194],"is":[32,133,184],"a":[33,73,127,164],"critical":[34],"issue.":[35],"Generally,":[36],"design":[38],"problems,":[39],"solutions":[42,60,115,119,140],"lie":[43],"somewhere":[44],"closer":[45],"to":[46,78,135,187,233],"nominal":[47,68,86,113,144,152],"points":[49,88,146],"compared":[50],"randomly":[52],"initialized":[53],"points.":[54,70,157],"The":[55,98,158,200],"searching":[56],"process":[57,173],"for":[58,204,211],"could":[61],"be":[62,175],"more":[63],"efficient":[64],"if":[65],"starting":[66,141],"from":[67,84,142,227],"We":[71],"propose":[72],"new":[74,128],"method":[75,161,230],"sequentially":[76],"approaching":[77],"the":[79,85,109,117,124,137,143,148,151,171,189,223,228,235,240],"front":[82,154],"(SARPF)":[83],"where":[89,112],"MOOPs":[90],"solved":[94,107],"two":[96],"stages.":[97],"deterministic":[99],"problem":[101,132],"and":[102,116,155,207,237],"robustness":[103],"metric":[104],"first":[110],"stage,":[111,126],"robust-most":[118,156],"identified,":[121],"respectively.":[122],"In":[123],"second":[125],"single-objective":[129,212],"formulated":[134],"region":[149],"between":[150],"proposed":[159,241],"SARPF":[160],"can":[162,174,195],"reduce":[163,196],"significant":[165],"amount":[166],"of":[167,239],"time":[169],"since":[170],"performed":[176],"parallel":[178],"at":[179],"each":[180],"stage.":[181],"Vertex":[182],"estimation":[183],"also":[185],"applied":[186],"approximate":[188],"worst-case":[190],"uncertain":[191],"parameter":[192],"values,":[193],"efforts":[198],"further.":[199],"global":[201],"solvers,":[202],"NSGA-II":[203],"cases":[206],"genetic":[208],"algorithm":[209],"(GA)":[210],"cases,":[213],"used":[215],"corresponding":[217],"processes.":[219],"Three":[220],"examples":[221],"comparison":[224],"results":[226],"previous":[229],"presented":[232],"demonstrate":[234],"applicability":[236],"efficiency":[238],"method.":[242]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}