{"id":"https://openalex.org/W2559419240","doi":"https://doi.org/10.1109/cec.2016.7744258","title":"Evolutionary algorithm with parallel evaluation strategy using constrained penalty-based boundary intersection","display_name":"Evolutionary algorithm with parallel evaluation strategy using constrained penalty-based boundary intersection","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2559419240","doi":"https://doi.org/10.1109/cec.2016.7744258","mag":"2559419240"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2016.7744258","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744258","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/A5065411208","display_name":"Koji Shimoyama","orcid":"https://orcid.org/0000-0001-8896-7707"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Koji Shimoyama","raw_affiliation_strings":["Institute of Fluid Science, Tohoku University, Sendai, Japan"],"affiliations":[{"raw_affiliation_string":"Institute of Fluid Science, Tohoku University, Sendai, Japan","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067432870","display_name":"Taiga Kato","orcid":null},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Taiga Kato","raw_affiliation_strings":["Institute of Fluid Science, Tohoku University, Sendai, Japan"],"affiliations":[{"raw_affiliation_string":"Institute of Fluid Science, Tohoku University, Sendai, Japan","institution_ids":["https://openalex.org/I201537933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065411208"],"corresponding_institution_ids":["https://openalex.org/I201537933"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.14417272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3702","last_page":"3709"},"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.9987999796867371,"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/T10998","display_name":"Heat Transfer and Optimization","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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.8085752129554749},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6269937753677368},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5877471566200256},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5847746729850769},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5770971775054932},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5329844355583191},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5311421751976013},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5291776061058044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5165563821792603},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46349430084228516},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.44031649827957153},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4328620433807373},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4250476658344269},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.415945440530777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3955892324447632},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32519546151161194},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07733365893363953}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.8085752129554749},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6269937753677368},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5877471566200256},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5847746729850769},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5770971775054932},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5329844355583191},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5311421751976013},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5291776061058044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5165563821792603},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46349430084228516},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.44031649827957153},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4328620433807373},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4250476658344269},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.415945440530777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3955892324447632},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32519546151161194},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07733365893363953},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2016.7744258","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744258","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1504532728","https://openalex.org/W1504943474","https://openalex.org/W1553373771","https://openalex.org/W1595498733","https://openalex.org/W2022485595","https://openalex.org/W2071960131","https://openalex.org/W2085507535","https://openalex.org/W2109880321","https://openalex.org/W2116661285","https://openalex.org/W2143381319","https://openalex.org/W4292408320","https://openalex.org/W6630172796"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W2001591765","https://openalex.org/W4241467429","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W2073147994","https://openalex.org/W2145877535","https://openalex.org/W1588199609","https://openalex.org/W2744730182","https://openalex.org/W2384474142"],"abstract_inverted_index":{"Most":[0],"of":[1,40,42,125],"real-world":[2],"optimization":[3,9],"problems":[4,10],"correspond":[5],"to":[6,18,36,92,129,135,151,161,172],"constrained":[7],"multi-objective":[8],"(CMOPs).":[11],"Multi-objective":[12],"evolutionary":[13,49],"algorithms":[14],"(MOEAs)":[15],"are":[16,63,72,88,102],"useful":[17,85],"find":[19],"out":[20],"diverse":[21],"Pareto-optimal":[22,132,153],"solutions":[23,59,71,82,87,101,133,154,175,206],"in":[24,30,66,74,207,234],"CMOPs,":[25,237],"and":[26,60,69,114,137,159,184,214],"has":[27],"been":[28],"applied":[29],"various":[31],"engineering":[32],"fields.":[33],"In":[34,56,218],"order":[35],"expand":[37],"the":[38,94,97,123,126,138,162,173,180,191,200,220,224],"range":[39],"application":[41],"MOEAs":[43],"further,":[44],"we":[45],"propose":[46],"an":[47,75,208],"improved":[48],"algorithm":[50],"with":[51,144,155],"parallel":[52],"evaluation":[53],"strategy":[54],"(EAPES).":[55],"EAPES,":[57],"feasible":[58,81],"infeasible":[61,70,86,174,205],"solution":[62,230],"separately":[64],"stored":[65],"different":[67],"populations,":[68],"evaluated":[73],"unusual":[76],"manner":[77],"where":[78],"not":[79,186],"only":[80],"but":[83],"also":[84],"used":[89],"as":[90],"parents":[91],"reproduce":[93],"populations":[95],"for":[96,131],"next":[98],"generation.":[99],"Infeasible":[100],"ranked":[103],"based":[104],"on":[105],"a":[106,115,145,195],"scalarizing":[107],"function":[108,112],"determined":[109],"by":[110,203],"objective":[111,212,241],"values":[113],"total":[116,215],"constraint":[117,216],"violation":[118],"value.":[119],"This":[120],"paper":[121],"investigates":[122],"performance":[124,232],"proposed":[127,142,167,192,225],"EAPES":[128,143,168,193,202,226],"search":[130,231],"compared":[134],"NSGA-II":[136],"previous":[139,201],"EAPES.":[140],"The":[141,166],"well-tuned":[146],"parameter":[147],"is":[148],"most":[149],"capable":[150],"explore":[152],"good":[156],"diversity,":[157],"spread,":[158],"convergence":[160],"true":[163,181],"Pareto":[164,182],"front.":[165],"assigns":[169],"bad":[170],"rank":[171],"that":[176,223],"exist":[177],"away":[178],"from":[179],"front,":[183],"does":[185],"store":[187],"such":[188],"solutions.":[189],"Thus":[190],"exhibits":[194],"higher":[196],"searching":[197],"capability":[198],"than":[199],"evaluating":[204],"appropriate":[209],"balance":[210],"between":[211],"functions":[213,242],"violation.":[217],"addition,":[219],"results":[221],"suggest":[222],"may":[227],"exhibit":[228],"high":[229],"even":[233],"more":[235,240,244],"difficult":[236],"which":[238],"have":[239],"and/or":[243],"constraints.":[245]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
