{"id":"https://openalex.org/W4411600017","doi":"https://doi.org/10.1109/cec65147.2025.11043123","title":"Effective Computational Resource Allocation in Evolutionary Multi-Objective Multi-Task Optimization","display_name":"Effective Computational Resource Allocation in Evolutionary Multi-Objective Multi-Task Optimization","publication_year":2025,"publication_date":"2025-06-08","ids":{"openalex":"https://openalex.org/W4411600017","doi":"https://doi.org/10.1109/cec65147.2025.11043123"},"language":"en","primary_location":{"id":"doi:10.1109/cec65147.2025.11043123","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec65147.2025.11043123","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Congress on Evolutionary Computation (CEC)","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/A5032434062","display_name":"Zhiming Dong","orcid":"https://orcid.org/0000-0002-1021-506X"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhiming Dong","raw_affiliation_strings":["Northeastern University,National Frontiers Science Center for Industrial Intelligence and Systems Optimization,Shenyang,China"],"affiliations":[{"raw_affiliation_string":"Northeastern University,National Frontiers Science Center for Industrial Intelligence and Systems Optimization,Shenyang,China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080165465","display_name":"Xianpeng Wang","orcid":"https://orcid.org/0000-0001-8132-9446"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xianpeng Wang","raw_affiliation_strings":["Northeastern University,National Frontiers Science Center for Industrial Intelligence and Systems Optimization,Shenyang,China"],"affiliations":[{"raw_affiliation_string":"Northeastern University,National Frontiers Science Center for Industrial Intelligence and Systems Optimization,Shenyang,China","institution_ids":["https://openalex.org/I9224756"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032434062"],"corresponding_institution_ids":["https://openalex.org/I9224756"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18520747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"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.9664000272750854,"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.9664000272750854,"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.964900016784668,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9151999950408936,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/computer-science","display_name":"Computer science","score":0.7465367317199707},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6263726353645325},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.6007363200187683},{"id":"https://openalex.org/keywords/resource-management","display_name":"Resource management (computing)","score":0.48427337408065796},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.47825849056243896},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.47639933228492737},{"id":"https://openalex.org/keywords/computational-resource","display_name":"Computational resource","score":0.4495184123516083},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39064767956733704},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3737829923629761},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.31808435916900635},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2665649354457855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10660076141357422},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0937071144580841},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07099008560180664},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06847897171974182},{"id":"https://openalex.org/keywords/systems-engineering","display_name":"Systems engineering","score":0.06277021765708923}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7465367317199707},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6263726353645325},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.6007363200187683},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.48427337408065796},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.47825849056243896},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.47639933228492737},{"id":"https://openalex.org/C127964446","wikidata":"https://www.wikidata.org/wiki/Q1092142","display_name":"Computational resource","level":3,"score":0.4495184123516083},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39064767956733704},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3737829923629761},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31808435916900635},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2665649354457855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10660076141357422},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0937071144580841},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07099008560180664},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06847897171974182},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.06277021765708923}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec65147.2025.11043123","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec65147.2025.11043123","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W2046725771","https://openalex.org/W2058142975","https://openalex.org/W2102625537","https://openalex.org/W2126105956","https://openalex.org/W2281646010","https://openalex.org/W2410677328","https://openalex.org/W2413527939","https://openalex.org/W2588868245","https://openalex.org/W2753754628","https://openalex.org/W2802480283","https://openalex.org/W2810440851","https://openalex.org/W2910556840","https://openalex.org/W2923639984","https://openalex.org/W2961463634","https://openalex.org/W2975673164","https://openalex.org/W2998409228","https://openalex.org/W3010321770","https://openalex.org/W3120732119","https://openalex.org/W4214660441","https://openalex.org/W4323322024","https://openalex.org/W4387546374","https://openalex.org/W4390493186","https://openalex.org/W6738788122"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W1560122427","https://openalex.org/W3041827036","https://openalex.org/W2923452570","https://openalex.org/W1993493607","https://openalex.org/W2021957875","https://openalex.org/W2038416433"],"abstract_inverted_index":{"Evolutionary":[0],"multitasking":[1],"optimization":[2,8,43,76,107],"achieves":[3],"efficient":[4],"solutions":[5],"to":[6,28,104],"multi-task":[7,42],"problems":[9],"through":[10],"the":[11,40,54,60,64,89,93,96,100,106,110],"transfer":[12],"and":[13,45,63,82,95,126],"reuse":[14],"of":[15,56,92,109,134],"genetic":[16],"information":[17],"across":[18],"tasks.":[19],"However,":[20],"in":[21,59,99,132],"scenarios":[22],"with":[23],"limited":[24],"computational":[25,48,123],"resources,":[26],"how":[27],"allocate":[29,122],"resources":[30,124],"among":[31],"tasks":[32],"effectively":[33,121],"remains":[34],"a":[35,47,79,84],"challenge.":[36],"This":[37],"paper":[38],"addresses":[39],"multi-objective":[41,72],"problem":[44],"proposes":[46],"resource":[49],"allocation":[50],"strategy":[51],"based":[52,87],"on":[53,88],"analytics":[55],"evolutionary":[57],"changes":[58,98],"objective":[61],"space":[62,103],"unified":[65,101],"search":[66,102],"space.":[67],"The":[68,112],"algorithm":[69,119],"decomposes":[70],"each":[71],"task":[73],"into":[74],"single-objective":[75],"subproblems":[77,94],"using":[78],"decomposition":[80],"strategy,":[81],"constructs":[83],"dual-utility":[85],"function":[86,91],"scalarizing":[90],"diversity":[97],"determine":[105],"priorities":[108],"subproblems.":[111],"experimental":[113],"results":[114],"demonstrate":[115],"that":[116],"our":[117],"proposed":[118],"can":[120],"dynamically":[125],"significantly":[127],"outperforms":[128],"many":[129],"comparison":[130],"algorithms":[131],"terms":[133],"inverted":[135],"generational":[136],"distance":[137],"related":[138],"metrics.":[139]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}