{"id":"https://openalex.org/W2559743179","doi":"https://doi.org/10.1109/cec.2016.7744246","title":"Dividing rectangles attack multi-objective optimization","display_name":"Dividing rectangles attack multi-objective optimization","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2559743179","doi":"https://doi.org/10.1109/cec.2016.7744246","mag":"2559743179"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2016.7744246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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/A5073112721","display_name":"Abdullah Al-Dujaili","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Abdullah Al-Dujaili","raw_affiliation_strings":["School of Computer Engineering, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":null,"display_name":"S. Suresh","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"S. Suresh","raw_affiliation_strings":["School of Computer Engineering, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073112721"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":5.3913,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.95967505,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3606","last_page":"3613"},"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/T11798","display_name":"Optimal Experimental Design Methods","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.7090299725532532},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6896355152130127},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6457589268684387},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6427371501922607},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.60200035572052},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5901009440422058},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5385699272155762},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5133970975875854},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.45772725343704224},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.43304139375686646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.320374071598053},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2535724639892578}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.7090299725532532},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6896355152130127},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6457589268684387},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6427371501922607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.60200035572052},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5901009440422058},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5385699272155762},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5133970975875854},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.45772725343704224},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.43304139375686646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.320374071598053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2535724639892578},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2016.7744246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322835","display_name":"Ministry of Economic Affairs","ror":"https://ror.org/042ge0913"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W194786220","https://openalex.org/W408795090","https://openalex.org/W1484507895","https://openalex.org/W1496629945","https://openalex.org/W1523008036","https://openalex.org/W1534033123","https://openalex.org/W1595498733","https://openalex.org/W1965681731","https://openalex.org/W2005649207","https://openalex.org/W2008499862","https://openalex.org/W2010642019","https://openalex.org/W2018306588","https://openalex.org/W2026299065","https://openalex.org/W2042585175","https://openalex.org/W2057830724","https://openalex.org/W2057951669","https://openalex.org/W2058922597","https://openalex.org/W2076264123","https://openalex.org/W2091503768","https://openalex.org/W2092611373","https://openalex.org/W2105245738","https://openalex.org/W2113741278","https://openalex.org/W2117626647","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2128459200","https://openalex.org/W2129827706","https://openalex.org/W2142633981","https://openalex.org/W2143185749","https://openalex.org/W2143381319","https://openalex.org/W2152551290","https://openalex.org/W2158642177","https://openalex.org/W2941281702","https://openalex.org/W2994964425","https://openalex.org/W4233757421","https://openalex.org/W4249254067","https://openalex.org/W4285719527","https://openalex.org/W4292408320","https://openalex.org/W4292864963","https://openalex.org/W6613973258","https://openalex.org/W6629088009","https://openalex.org/W6631322389","https://openalex.org/W6677477198","https://openalex.org/W6771627385"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W85101999","https://openalex.org/W2145877535","https://openalex.org/W2744730182","https://openalex.org/W3134440233","https://openalex.org/W2751605210","https://openalex.org/W2022485595"],"abstract_inverted_index":{"Decomposition-based":[0],"evolutionary":[1,139],"algorithms":[2],"have":[3],"been":[4],"applied":[5],"with":[6,47,89],"success":[7],"to":[8,82,91,100,122,137],"multi-objective":[9,50,74,94],"optimization":[10],"problems":[11,51],"where":[12],"they":[13],"are":[14,25],"broken":[15],"into":[16],"several":[17],"subproblems,":[18],"and":[19,85,104,110],"solutions":[20],"for":[21],"the":[22,33,40,63,101,113,116,128,138],"original":[23],"problem":[24],"recognized":[26],"in":[27],"a":[28,53,73,131],"coordinated":[29],"manner.":[30],"Motivated":[31],"by":[32,59],"working":[34],"principle":[35],"of":[36,56,77,112,130],"decomposition-based":[37,93],"methods,":[38],"viz.":[39],"\u201cdivide-and-conquer\u201d":[41],"paradigm;":[42],"this":[43],"paper":[44],"is":[45,119],"concerned":[46],"solving":[48],"black-box":[49],"given":[52],"finite":[54],"number":[55],"function":[57],"evaluations":[58],"taking":[60],"inspiration":[61],"from":[62],"single-objective":[64],"deterministic":[65],"sampling":[66],"method,":[67],"DIRECT.":[68],"In":[69],"particular,":[70],"we":[71,80],"provide":[72],"algorithmic":[75],"instance":[76],"DIRECT,":[78],"which":[79],"refer":[81],"as":[83],"MO-DIRECT":[84],"investigate":[86],"its":[87,97,105],"performance":[88],"respect":[90],"established":[92],"techniques.":[95],"Besides":[96],"asymptotic":[98],"convergence":[99],"Pareto":[102],"front":[103],"inherent":[106],"balance":[107],"between":[108],"exploration":[109],"exploitation":[111],"decision":[114],"space,":[115],"proposed":[117],"framework":[118],"flexible":[120],"enough":[121],"incorporate":[123],"indicator-based":[124],"techniques,":[125],"albeit":[126],"at":[127],"cost":[129],"greater":[132],"space":[133],"complexity":[134],"when":[135],"compared":[136],"counterpart.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}