{"id":"https://openalex.org/W4391793069","doi":"https://doi.org/10.1109/icceic60201.2023.10426708","title":"Dynamic Constrained Time-Domain Robust Optimization with Noises","display_name":"Dynamic Constrained Time-Domain Robust Optimization with Noises","publication_year":2023,"publication_date":"2023-10-20","ids":{"openalex":"https://openalex.org/W4391793069","doi":"https://doi.org/10.1109/icceic60201.2023.10426708"},"language":"en","primary_location":{"id":"doi:10.1109/icceic60201.2023.10426708","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icceic60201.2023.10426708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 4th International Conference on Computer Engineering and Intelligent Control (ICCEIC)","raw_type":"proceedings-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/A5100392899","display_name":"Bin Zhang","orcid":"https://orcid.org/0000-0003-0633-2930"},"institutions":[{"id":"https://openalex.org/I109935558","display_name":"Ningbo University","ror":"https://ror.org/03et85d35","country_code":"CN","type":"education","lineage":["https://openalex.org/I109935558"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Bin Zhang","raw_affiliation_strings":["Ningbo University,Faculty of electrical engineering and computer science,Ningbo,China","Faculty of electrical engineering and computer science, Ningbo University, Ningbo, China"],"affiliations":[{"raw_affiliation_string":"Ningbo University,Faculty of electrical engineering and computer science,Ningbo,China","institution_ids":["https://openalex.org/I109935558"]},{"raw_affiliation_string":"Faculty of electrical engineering and computer science, Ningbo University, Ningbo, China","institution_ids":["https://openalex.org/I109935558"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101551333","display_name":"Xuhua Shi","orcid":null},"institutions":[{"id":"https://openalex.org/I109935558","display_name":"Ningbo University","ror":"https://ror.org/03et85d35","country_code":"CN","type":"education","lineage":["https://openalex.org/I109935558"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuhua Shi","raw_affiliation_strings":["Ningbo University,Faculty of electrical engineering and computer science,Ningbo,China","Faculty of electrical engineering and computer science, Ningbo University, Ningbo, China"],"affiliations":[{"raw_affiliation_string":"Ningbo University,Faculty of electrical engineering and computer science,Ningbo,China","institution_ids":["https://openalex.org/I109935558"]},{"raw_affiliation_string":"Faculty of electrical engineering and computer science, Ningbo University, Ningbo, China","institution_ids":["https://openalex.org/I109935558"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100392899"],"corresponding_institution_ids":["https://openalex.org/I109935558"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27456638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"290","last_page":"295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9994999766349792,"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":0.9994999766349792,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11115","display_name":"Topology Optimization in Engineering","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.8443224430084229},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6792216897010803},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6362853646278381},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6187484860420227},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6122578382492065},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.6121523380279541},{"id":"https://openalex.org/keywords/time-domain","display_name":"Time domain","score":0.5294287800788879},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.45990702509880066},{"id":"https://openalex.org/keywords/constrained-optimization-problem","display_name":"Constrained optimization problem","score":0.43062782287597656},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.42353302240371704},{"id":"https://openalex.org/keywords/engineering-optimization","display_name":"Engineering optimization","score":0.4134727716445923},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.41321098804473877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17955529689788818}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.8443224430084229},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6792216897010803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6362853646278381},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6187484860420227},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6122578382492065},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.6121523380279541},{"id":"https://openalex.org/C103824480","wikidata":"https://www.wikidata.org/wiki/Q185889","display_name":"Time domain","level":2,"score":0.5294287800788879},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.45990702509880066},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.43062782287597656},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.42353302240371704},{"id":"https://openalex.org/C110850998","wikidata":"https://www.wikidata.org/wiki/Q5377895","display_name":"Engineering optimization","level":3,"score":0.4134727716445923},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.41321098804473877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17955529689788818},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icceic60201.2023.10426708","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icceic60201.2023.10426708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 4th International Conference on Computer Engineering and Intelligent Control (ICCEIC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W130071847","https://openalex.org/W1976718992","https://openalex.org/W2025044382","https://openalex.org/W2074825805","https://openalex.org/W2125714469","https://openalex.org/W2130602638","https://openalex.org/W2137130066","https://openalex.org/W2154259362","https://openalex.org/W2513987709","https://openalex.org/W2588443700","https://openalex.org/W2601733549","https://openalex.org/W2928759908","https://openalex.org/W2965883787","https://openalex.org/W3020809103"],"related_works":["https://openalex.org/W2140496876","https://openalex.org/W3017736765","https://openalex.org/W193468460","https://openalex.org/W2883204331","https://openalex.org/W4294706475","https://openalex.org/W4387027548","https://openalex.org/W2740343970","https://openalex.org/W4293570283","https://openalex.org/W2216231335","https://openalex.org/W173389284"],"abstract_inverted_index":{"In":[0],"the":[1,42,46,50,82,96,99,106,137,146,154,177,180],"field":[2],"of":[3,37,52,68,80,139,156,179],"engineering":[4,84],"optimization":[5,10,18,24,85,114],"design,":[6],"there":[7],"are":[8,26,131],"many":[9],"problems":[11,86],"with":[12,92],"time-varying":[13],"objective":[14],"functions.":[15],"Tracking":[16],"motion":[17],"(TMO)":[19],"and":[20,73,89,119,129,136],"time":[21],"domain":[22],"Robust":[23],"(ROOT)":[25],"two":[27],"widely":[28],"used":[29],"methods":[30],"to":[31,40,55,62,144,151],"solve":[32],"this":[33,125],"problem.":[34],"The":[35],"purpose":[36,51],"TMO":[38,72],"is":[39,54,122,142],"find":[41,56,168],"optimal":[43],"solution":[44,58],"before":[45],"environment":[47],"changes,":[48],"while":[49],"ROOT":[53,74],"a":[57,65,109],"that":[59,165],"can":[60,167],"adapt":[61],"changes":[63],"over":[64],"long":[66],"period":[67],"time.":[69,93],"However,":[70],"both":[71],"approaches":[75],"have":[76,87],"some":[77],"defects.":[78],"First":[79],"all,":[81],"existing":[83],"constraints":[88],"will":[90,104],"change":[91],"Second,":[94],"in":[95,101,124,159,171],"optimizing":[97],"environment,":[98],"noises":[100,118],"most":[102],"environments":[103],"affect":[105],"candidates.":[107],"Therefore,":[108],"dynamic":[110],"constrained":[111],"time-domain":[112],"robust":[113],"algorithm":[115],"(DCRO/SCNO)":[116],"considering":[117],"switching":[120],"costs":[121],"proposed":[123],"paper.":[126],"Switching":[127],"cost":[128],"robustness":[130],"considered":[132],"as":[133],"multi-objective":[134],"optimization,":[135],"idea":[138],"double":[140],"elite":[141,182],"introduced":[143],"divide":[145],"population":[147],"into":[148],"three":[149],"groups":[150],"collaborate":[152],"for":[153],"problem":[155],"non-robustness":[157],"solutions":[158,170],"noisy":[160],"environment.":[161],"Benchmark":[162],"experiments":[163],"show":[164],"DCRO/SCNO":[166],"non-dominant":[169],"different":[172],"noise":[173],"environments,":[174],"which":[175],"confirms":[176],"validity":[178],"dual":[181],"idea.":[183]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}