{"id":"https://openalex.org/W2557894284","doi":"https://doi.org/10.1109/cec.2016.7744174","title":"Performance comparison of NSGA-II and NSGA-III on various many-objective test problems","display_name":"Performance comparison of NSGA-II and NSGA-III on various many-objective test problems","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2557894284","doi":"https://doi.org/10.1109/cec.2016.7744174","mag":"2557894284"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2016.7744174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744174","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/A5035595838","display_name":"Hisao Ishibuchi","orcid":"https://orcid.org/0000-0001-9186-6472"},"institutions":[{"id":"https://openalex.org/I15807432","display_name":"Osaka Prefecture University","ror":"https://ror.org/02cf1je33","country_code":"JP","type":"education","lineage":["https://openalex.org/I15807432"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Hisao Ishibuchi","raw_affiliation_strings":["Department of Computer Science and Intelligent Systems Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan","institution_ids":["https://openalex.org/I15807432"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057108498","display_name":"Ryo Imada","orcid":null},"institutions":[{"id":"https://openalex.org/I15807432","display_name":"Osaka Prefecture University","ror":"https://ror.org/02cf1je33","country_code":"JP","type":"education","lineage":["https://openalex.org/I15807432"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryo Imada","raw_affiliation_strings":["Department of Computer Science and Intelligent Systems Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan","institution_ids":["https://openalex.org/I15807432"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072935373","display_name":"Yu Setoguchi","orcid":null},"institutions":[{"id":"https://openalex.org/I15807432","display_name":"Osaka Prefecture University","ror":"https://ror.org/02cf1je33","country_code":"JP","type":"education","lineage":["https://openalex.org/I15807432"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yu Setoguchi","raw_affiliation_strings":["Department of Computer Science and Intelligent Systems Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan","institution_ids":["https://openalex.org/I15807432"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004957967","display_name":"Yusuke Nojima","orcid":"https://orcid.org/0000-0003-4853-1305"},"institutions":[{"id":"https://openalex.org/I15807432","display_name":"Osaka Prefecture University","ror":"https://ror.org/02cf1je33","country_code":"JP","type":"education","lineage":["https://openalex.org/I15807432"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yusuke Nojima","raw_affiliation_strings":["Department of Computer Science and Intelligent Systems Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Intelligent Systems Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, Japan","institution_ids":["https://openalex.org/I15807432"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5035595838"],"corresponding_institution_ids":["https://openalex.org/I15807432"],"apc_list":null,"apc_paid":null,"fwci":7.9793,"has_fulltext":false,"cited_by_count":187,"citation_normalized_percentile":{"value":0.97576904,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"3045","last_page":"3052"},"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.9998999834060669,"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.9998999834060669,"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.9987000226974487,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8696988224983215},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7235880494117737},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6452098488807678},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.622336745262146},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6164443492889404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5780544281005859},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5496009588241577},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5245454907417297},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.42369601130485535},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4210693836212158},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33025407791137695}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8696988224983215},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7235880494117737},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6452098488807678},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.622336745262146},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6164443492889404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5780544281005859},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5496009588241577},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5245454907417297},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.42369601130485535},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4210693836212158},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33025407791137695},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2016.7744174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744174","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1595498733","https://openalex.org/W1662894842","https://openalex.org/W1846834309","https://openalex.org/W1963550655","https://openalex.org/W1977398789","https://openalex.org/W2000825106","https://openalex.org/W2022485595","https://openalex.org/W2040622444","https://openalex.org/W2049862811","https://openalex.org/W2067544246","https://openalex.org/W2097536098","https://openalex.org/W2106334424","https://openalex.org/W2118693290","https://openalex.org/W2126105956","https://openalex.org/W2126273906","https://openalex.org/W2127459836","https://openalex.org/W2143185749","https://openalex.org/W2167159964","https://openalex.org/W2343498104","https://openalex.org/W6638887577","https://openalex.org/W6684212943"],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W2005493932","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2145407993","https://openalex.org/W2133099979","https://openalex.org/W3103982436","https://openalex.org/W2888641532"],"abstract_inverted_index":{"Recently":[0],"NSGA-III":[1,18,43,78,110,153,219],"has":[2,19,92,189],"been":[3,20,93],"frequently":[4,94],"used":[5,21,56,95],"for":[6,26,96,160,220],"performance":[7,76,97,108],"comparison":[8,62,98,112,166,195],"of":[9,41,77,83,109,120,143,174,181,186,200,218],"newly":[10],"proposed":[11],"evolutionary":[12,27],"many-objective":[13,28,84,121],"optimization":[14],"algorithms.":[15],"That":[16,163],"is,":[17,164],"as":[22],"a":[23,52,58,73,80,190],"benchmark":[24],"algorithm":[25],"optimization.":[29],"However,":[30],"unfortunately,":[31],"its":[32],"source":[33],"code":[34],"is":[35,55,63,87],"not":[36,155,169],"available":[37],"from":[38,215],"the":[39,42,75,100,107,172,179,198],"authors":[40],"paper.":[44],"This":[45],"leads":[46],"to":[47],"an":[48],"undesirable":[49],"situation":[50],"where":[51],"different":[53,59,118,141,211,216],"implementation":[54],"in":[57,99,111,202],"study.":[60],"Moreover,":[61],"usually":[64],"performed":[65],"on":[66,79,115,171,178,193],"DTLZ":[67],"and":[68,135,145],"WFG":[69],"test":[70,85,122,182,187,222],"problems.":[71,137,162,183,223],"As":[72],"result,":[74],"wide":[81],"variety":[82],"problems":[86,123,188],"still":[88],"unclear":[89],"whereas":[90],"it":[91],"literature.":[101],"In":[102],"this":[103],"paper,":[104],"we":[105],"evaluate":[106],"with":[113,124],"NSGA-II":[114,144,158],"four":[116],"totally":[117,210],"types":[119],"3-10":[125],"objectives:":[126],"DTLZ1-4":[127],"problems,":[128,134],"their":[129,165,194],"maximization":[130],"variants,":[131],"distance":[132],"minimization":[133],"knapsack":[136],"We":[138,147,206],"use":[139],"two":[140],"implementations":[142,217],"NSGA-III.":[146],"show":[148],"through":[149],"computational":[150,204],"experiments":[151],"that":[152,209],"does":[154],"always":[156],"outperform":[157],"even":[159],"ten-objective":[161],"results":[167,196,212],"depend":[168],"only":[170],"number":[173,199],"objectives":[175,201],"but":[176],"also":[177,207],"type":[180],"The":[184],"choice":[185],"larger":[191],"effect":[192],"than":[197],"our":[203],"experiments.":[205],"demonstrate":[208],"are":[213],"obtained":[214],"some":[221]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":50},{"year":2024,"cited_by_count":26},{"year":2023,"cited_by_count":25},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":24},{"year":2020,"cited_by_count":19},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3}],"updated_date":"2026-04-04T08:04:53.788161","created_date":"2025-10-10T00:00:00"}