{"id":"https://openalex.org/W4362681522","doi":"https://doi.org/10.1109/tevc.2023.3265347","title":"Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization","display_name":"Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization","publication_year":2023,"publication_date":"2023-04-06","ids":{"openalex":"https://openalex.org/W4362681522","doi":"https://doi.org/10.1109/tevc.2023.3265347"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2023.3265347","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2023.3265347","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://scholars.cityu.edu.hk/en/publications/hypervolume-guided-decomposition-for-parallel-expensive-multiobje","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102744115","display_name":"Liang Zhao","orcid":"https://orcid.org/0000-0003-3735-936X"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]},{"id":"https://openalex.org/I4210105229","display_name":"City University of Hong Kong, Shenzhen Research Institute","ror":"https://ror.org/00xc0ma20","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210105229"]}],"countries":["CN","HK"],"is_corresponding":false,"raw_author_name":"Liang Zhao","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong","City University of Hong Kong Shenzhen Research Institute, Shenzhen, China"],"raw_orcid":"https://orcid.org/0000-0003-3735-936X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"City University of Hong Kong Shenzhen Research Institute, Shenzhen, China","institution_ids":["https://openalex.org/I168719708","https://openalex.org/I4210105229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000546219","display_name":"Qingfu Zhang","orcid":"https://orcid.org/0000-0003-0786-0671"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]},{"id":"https://openalex.org/I4210105229","display_name":"City University of Hong Kong, Shenzhen Research Institute","ror":"https://ror.org/00xc0ma20","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210105229"]}],"countries":["CN","HK"],"is_corresponding":false,"raw_author_name":"Qingfu Zhang","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong","City University of Hong Kong Shenzhen Research Institute, Shenzhen, China"],"raw_orcid":"https://orcid.org/0000-0003-0786-0671","affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"City University of Hong Kong Shenzhen Research Institute, Shenzhen, China","institution_ids":["https://openalex.org/I168719708","https://openalex.org/I4210105229"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4032,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.95600877,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"28","issue":"2","first_page":"432","last_page":"444"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9986000061035156,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.994700014591217,"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/benchmark","display_name":"Benchmark (surveying)","score":0.7796734571456909},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7025559544563293},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.664818525314331},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6016495227813721},{"id":"https://openalex.org/keywords/bayesian-optimization","display_name":"Bayesian optimization","score":0.5825557708740234},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48309826850891113},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.46729424595832825},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4491420388221741},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4264851212501526},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3869136571884155},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1237349808216095}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7796734571456909},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7025559544563293},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.664818525314331},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6016495227813721},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.5825557708740234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48309826850891113},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.46729424595832825},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4491420388221741},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4264851212501526},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3869136571884155},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1237349808216095},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tevc.2023.3265347","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2023.3265347","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"},{"is_oa":true,"landing_page_url":"https://scholars.cityu.edu.hk/en/publications/hypervolume-guided-decomposition-for-parallel-expensive-multiobje","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zhao, L & Zhang, Q 2024, 'Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization', IEEE Transactions on Evolutionary Computation, vol. 28, no. 2, pp. 432-444. https://doi.org/10.1109/TEVC.2023.3265347","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:publications/f8a408fd-39de-4699-b3be-941cde505d4b","is_oa":true,"landing_page_url":"https://hdl.handle.net/2031/f8a408fd-39de-4699-b3be-941cde505d4b","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zhao, L & Zhang, Q 2024, 'Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization', IEEE Transactions on Evolutionary Computation, vol. 28, no. 2, pp. 432-444. https://doi.org/10.1109/TEVC.2023.3265347","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://scholars.cityu.edu.hk/en/publications/hypervolume-guided-decomposition-for-parallel-expensive-multiobje","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zhao, L & Zhang, Q 2024, 'Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization', IEEE Transactions on Evolutionary Computation, vol. 28, no. 2, pp. 432-444. https://doi.org/10.1109/TEVC.2023.3265347","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6722582353","display_name":null,"funder_award_id":"62276223","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":70,"referenced_works":["https://openalex.org/W135104305","https://openalex.org/W224959492","https://openalex.org/W1510052597","https://openalex.org/W1564638059","https://openalex.org/W1680189815","https://openalex.org/W1695563742","https://openalex.org/W1846834309","https://openalex.org/W1987443278","https://openalex.org/W2017299308","https://openalex.org/W2024008934","https://openalex.org/W2045477604","https://openalex.org/W2066009943","https://openalex.org/W2075575884","https://openalex.org/W2085572003","https://openalex.org/W2088235871","https://openalex.org/W2098629435","https://openalex.org/W2105245738","https://openalex.org/W2106334424","https://openalex.org/W2111526171","https://openalex.org/W2125240538","https://openalex.org/W2136918060","https://openalex.org/W2143381319","https://openalex.org/W2150046657","https://openalex.org/W2152551290","https://openalex.org/W2161055009","https://openalex.org/W2192203593","https://openalex.org/W2201048008","https://openalex.org/W2485514315","https://openalex.org/W2500139799","https://openalex.org/W2519112510","https://openalex.org/W2548304608","https://openalex.org/W2559173494","https://openalex.org/W2589080402","https://openalex.org/W2605726844","https://openalex.org/W2609215372","https://openalex.org/W2616650140","https://openalex.org/W2764251381","https://openalex.org/W2771397668","https://openalex.org/W2785722638","https://openalex.org/W2791362611","https://openalex.org/W2808296162","https://openalex.org/W2886177894","https://openalex.org/W2889888913","https://openalex.org/W2898760882","https://openalex.org/W2900306973","https://openalex.org/W2904210708","https://openalex.org/W2912436365","https://openalex.org/W2941114335","https://openalex.org/W2944367955","https://openalex.org/W2953460162","https://openalex.org/W2968893390","https://openalex.org/W2995997144","https://openalex.org/W2998757713","https://openalex.org/W3009895648","https://openalex.org/W3042036888","https://openalex.org/W3046766376","https://openalex.org/W3099988708","https://openalex.org/W3101465817","https://openalex.org/W4250589301","https://openalex.org/W4252003911","https://openalex.org/W4289489521","https://openalex.org/W6678911119","https://openalex.org/W6751513613","https://openalex.org/W6754772235","https://openalex.org/W6756221766","https://openalex.org/W6756847143","https://openalex.org/W6762925210","https://openalex.org/W6779730510","https://openalex.org/W6780116775","https://openalex.org/W6845327098"],"related_works":["https://openalex.org/W1482441085","https://openalex.org/W2966858528","https://openalex.org/W2151687600","https://openalex.org/W2996366161","https://openalex.org/W4318703531","https://openalex.org/W4252419006","https://openalex.org/W4304194161","https://openalex.org/W4386159657","https://openalex.org/W4226220869","https://openalex.org/W2809500545"],"abstract_inverted_index":{"The":[0,61],"hypervolume":[1,58,66,108],"metric":[2],"is":[3,134,168,192],"widely":[4],"used":[5,135,169],"to":[6,103,136,143,170],"guide":[7],"the":[8,19,34,46,55,65,74,94,106,110,132,138,176],"search":[9],"in":[10,14,149],"multiobjective":[11,17,126,201],"optimization.":[12,202],"However,":[13],"parallel":[15,199],"expensive":[16,125,200],"optimization,":[18],"hypervolume-based":[20,43],"multipoint":[21],"expected":[22,56],"improvement":[23,59,67,99,112],"(EI)":[24],"suffers":[25],"from":[26,175],"high":[27],"computational":[28],"overhead":[29],"and":[30,49,109,153,184,195],"scales":[31],"poorly":[32],"with":[33,45,141],"batch":[35],"size.":[36],"To":[37],"address":[38],"this":[39],"issue,":[40],"we":[41,116],"integrate":[42],"EI":[44],"MOEA/D":[47,133],"framework":[48],"propose":[50],"a":[51,81,118,144,150,154,163],"novel":[52],"EI,":[53],"named":[54],"direction-based":[57],"(DirHV-EI).":[60],"DirHV-EI":[62,139],"only":[63],"measures":[64],"within":[68],"each":[69,130],"axis-parallel":[70],"box":[71],"induced":[72],"by":[73],"modified":[75],"Tchebycheff":[76,111],"scalarization.":[77],"Thus,":[78],"it":[79],"has":[80],"simple":[82],"analytical":[83],"expression":[84],"that":[85,93,188],"can":[86,101,159],"be":[87,160],"easily":[88],"computed.":[89],"Theoretical":[90],"analysis":[91],"indicates":[92],"maximization":[95],"of":[96,146,156],"our":[97,189],"proposed":[98,190],"function":[100],"help":[102],"maximize":[104,137],"both":[105,181],"weighted":[107],"metrics.":[113],"Using":[114],"DirHV-EI,":[115],"design":[117],"decomposition-based":[119],"Bayesian":[120],"optimization":[121,127],"algorithm":[122,191],"for":[123,198],"solving":[124],"problems.":[128],"At":[129],"iteration,":[131],"values":[140],"respect":[142],"number":[145,155],"direction":[147],"vectors":[148],"collaborative":[151],"manner,":[152],"candidate":[157],"solutions":[158],"obtained.":[161],"Then,":[162],"submodularity-based":[164],"greedy":[165],"selection":[166],"strategy":[167],"select":[171],"multiple":[172],"query":[173],"points":[174],"candidates.":[177],"Experimental":[178],"results":[179],"on":[180],"benchmark":[182],"instances":[183],"real-world":[185],"problems":[186],"show":[187],"an":[193],"efficient":[194],"effective":[196],"method":[197]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":16},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}