{"id":"https://openalex.org/W2013796846","doi":"https://doi.org/10.1109/cec.2014.6900645","title":"A multi-objective evolutionary algorithm based on decomposition for constrained multi-objective optimization","display_name":"A multi-objective evolutionary algorithm based on decomposition for constrained multi-objective optimization","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2013796846","doi":"https://doi.org/10.1109/cec.2014.6900645","mag":"2013796846"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2014.6900645","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 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/A5058923986","display_name":"Sa\u00fal Zapotecas\u2013Mart\u00ednez","orcid":"https://orcid.org/0000-0003-1281-9040"},"institutions":[{"id":"https://openalex.org/I137975476","display_name":"Shinshu University","ror":"https://ror.org/0244rem06","country_code":"JP","type":"education","lineage":["https://openalex.org/I137975476"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Saul Zapotecas Martinez","raw_affiliation_strings":["Faculty of Engineering, Shinshu University, Nagano, Japan","Shinshu University, Faculty of Engineering, 4-17-1 Wakasato, Nagano 380-8553 Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Shinshu University, Nagano, Japan","institution_ids":["https://openalex.org/I137975476"]},{"raw_affiliation_string":"Shinshu University, Faculty of Engineering, 4-17-1 Wakasato, Nagano 380-8553 Japan","institution_ids":["https://openalex.org/I137975476"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085548317","display_name":"Carlos A. Coello Coello","orcid":"https://orcid.org/0000-0002-8435-680X"},"institutions":[{"id":"https://openalex.org/I137975476","display_name":"Shinshu University","ror":"https://ror.org/0244rem06","country_code":"JP","type":"education","lineage":["https://openalex.org/I137975476"]},{"id":"https://openalex.org/I68368234","display_name":"Center for Research and Advanced Studies of the National Polytechnic Institute","ror":"https://ror.org/009eqmr18","country_code":"MX","type":"facility","lineage":["https://openalex.org/I59361560","https://openalex.org/I68368234"]}],"countries":["JP","MX"],"is_corresponding":false,"raw_author_name":"Carlos A. Coello Coello","raw_affiliation_strings":["Faculty of Engineering, Shinshu University, Nagano, Japan","[CINVESTAV-IPN, Departamento de Computati\u00f3n Av. IPN 2508. San Pedro Zacatenco, M\u00e9xico D.F. 07300, M\u00e9xico]"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Shinshu University, Nagano, Japan","institution_ids":["https://openalex.org/I137975476"]},{"raw_affiliation_string":"[CINVESTAV-IPN, Departamento de Computati\u00f3n Av. IPN 2508. San Pedro Zacatenco, M\u00e9xico D.F. 07300, M\u00e9xico]","institution_ids":["https://openalex.org/I68368234"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058923986"],"corresponding_institution_ids":["https://openalex.org/I137975476"],"apc_list":null,"apc_paid":null,"fwci":4.6291,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.95005361,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"429","last_page":"436"},"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.9983000159263611,"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.9901000261306763,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7528232336044312},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.7180562019348145},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6908693909645081},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6476349830627441},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6239312887191772},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5431796908378601},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.5360062122344971},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49980950355529785},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.45100581645965576},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.42111098766326904},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2725192606449127},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21977251768112183}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7528232336044312},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.7180562019348145},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6908693909645081},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6476349830627441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6239312887191772},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5431796908378601},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5360062122344971},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49980950355529785},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.45100581645965576},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.42111098766326904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2725192606449127},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21977251768112183},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2014.6900645","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W113753875","https://openalex.org/W163714175","https://openalex.org/W181374404","https://openalex.org/W1490504768","https://openalex.org/W1502374754","https://openalex.org/W1540838551","https://openalex.org/W1553373771","https://openalex.org/W1558919105","https://openalex.org/W1887471722","https://openalex.org/W1982048452","https://openalex.org/W1988664437","https://openalex.org/W1998674867","https://openalex.org/W2011882435","https://openalex.org/W2067923752","https://openalex.org/W2068411105","https://openalex.org/W2098907614","https://openalex.org/W2102625537","https://openalex.org/W2106069570","https://openalex.org/W2122153936","https://openalex.org/W2126105956","https://openalex.org/W2143381319","https://openalex.org/W2150046657","https://openalex.org/W2167580870","https://openalex.org/W2172135250","https://openalex.org/W2432516117","https://openalex.org/W3137715965","https://openalex.org/W4250934702","https://openalex.org/W4292864963","https://openalex.org/W4302557773","https://openalex.org/W6632536631","https://openalex.org/W6647614648"],"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":{"In":[0,27,59],"spite":[1],"of":[2,5,44,48],"the":[3,6,28,42,70,81,93,97,123],"popularity":[4],"Multi-objective":[7,18],"Evolutionary":[8],"Algorithm":[9],"based":[10,55,68],"on":[11,56,69],"Decomposition":[12],"(MOEA/D),":[13],"its":[14],"use":[15],"in":[16,84,86,119,128],"Constrained":[17],"Optimization":[19],"Problems":[20],"(CMOPs)":[21],"has":[22],"not":[23],"been":[24,34],"fully":[25],"explored.":[26],"last":[29],"few":[30,36],"years,":[31],"there":[32],"have":[33,51],"a":[35,64,114],"proposals":[37,50],"to":[38,41,80,88,113],"extend":[39],"MOEA/D":[40,85],"solution":[43],"CMOPs.":[45],"However,":[46],"most":[47],"these":[49],"adopted":[52,83,127],"selection":[53,66],"mechanisms":[54],"penalty":[57],"functions.":[58],"this":[60],"paper,":[61],"we":[62],"present":[63],"novel":[65],"mechanism":[67],"well-known":[71],"\u03b5-constraint":[72],"method.":[73],"The":[74],"proposed":[75],"approach":[76,107],"uses":[77],"information":[78],"related":[79],"neighborhood":[82],"order":[87],"obtain":[89],"solutions":[90],"which":[91,117],"minimize":[92],"objective":[94],"functions":[95],"within":[96],"allowed":[98],"feasible":[99],"region.":[100],"Our":[101],"preliminary":[102],"results":[103],"indicate":[104],"that":[105],"our":[106,129],"is":[108],"highly":[109],"competitive":[110],"with":[111],"respect":[112],"state-of-the-art":[115],"MOEA":[116],"solves":[118],"an":[120],"efficient":[121],"way":[122],"constrained":[124],"test":[125],"problems":[126],"comparative":[130],"study.":[131]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}