{"id":"https://openalex.org/W3083503885","doi":"https://doi.org/10.1109/cec48606.2020.9185546","title":"A Running Performance Metric and Termination Criterion for Evaluating Evolutionary Multi- and Many-objective Optimization Algorithms","display_name":"A Running Performance Metric and Termination Criterion for Evaluating Evolutionary Multi- and Many-objective Optimization Algorithms","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3083503885","doi":"https://doi.org/10.1109/cec48606.2020.9185546","mag":"3083503885"},"language":"en","primary_location":{"id":"doi:10.1109/cec48606.2020.9185546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec48606.2020.9185546","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5047107500","display_name":"Julian Blank","orcid":"https://orcid.org/0000-0002-2227-6476"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julian Blank","raw_affiliation_strings":["Computer Science and Engineering, Michigan State University, East Lansing, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Michigan State University, East Lansing, United States","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088394271","display_name":"Kalyanmoy Deb","orcid":"https://orcid.org/0000-0001-7402-9939"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kalyanmoy Deb","raw_affiliation_strings":["Electrical and Computer Engineering, Michigan State University, East Lansing, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Michigan State University, East Lansing, United States","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I87216513"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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.9976000189781189,"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.9959999918937683,"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/metric","display_name":"Metric (unit)","score":0.6857225894927979},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6425637006759644},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6350935697555542},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6170856952667236},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6057546138763428},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5934321284294128},{"id":"https://openalex.org/keywords/performance-metric","display_name":"Performance metric","score":0.5614162683486938},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.48584887385368347},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4743836224079132},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.472265362739563},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.46184179186820984},{"id":"https://openalex.org/keywords/solution-set","display_name":"Solution set","score":0.4487704634666443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28546005487442017},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1954796314239502}],"concepts":[{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6857225894927979},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6425637006759644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6350935697555542},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6170856952667236},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6057546138763428},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5934321284294128},{"id":"https://openalex.org/C2780898871","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Performance metric","level":2,"score":0.5614162683486938},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.48584887385368347},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4743836224079132},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.472265362739563},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.46184179186820984},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.4487704634666443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28546005487442017},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1954796314239502},{"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},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec48606.2020.9185546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec48606.2020.9185546","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 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":19,"referenced_works":["https://openalex.org/W224959492","https://openalex.org/W1543520236","https://openalex.org/W1558919105","https://openalex.org/W1607104331","https://openalex.org/W2022485595","https://openalex.org/W2085507535","https://openalex.org/W2102365077","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2135879356","https://openalex.org/W2152551290","https://openalex.org/W2207649084","https://openalex.org/W2606395562","https://openalex.org/W2803331670","https://openalex.org/W2890583810","https://openalex.org/W2913670039","https://openalex.org/W3021613070","https://openalex.org/W6633513437","https://openalex.org/W6758483790"],"related_works":["https://openalex.org/W1913250734","https://openalex.org/W2197574022","https://openalex.org/W1536531504","https://openalex.org/W1534737284","https://openalex.org/W1491338215","https://openalex.org/W2905454183","https://openalex.org/W2316613179","https://openalex.org/W2016746512","https://openalex.org/W2137328093","https://openalex.org/W2904526685"],"abstract_inverted_index":{"Researchers":[0],"have":[1],"spent":[2],"a":[3,11,62,149,157,195],"considerable":[4],"effort":[5],"in":[6,109],"evaluating":[7],"the":[8,26,29,44,72,78,91,99,103,107,110,126,129,133,153,188],"goodness":[9],"of":[10,28,119,125,142,155,159,187],"solution":[12,46,111,135],"set":[13,32,136,158],"obtained":[14],"by":[15,122,147],"an":[16,39],"evolutionary":[17,179],"multi-objective":[18,95,180,196],"algorithm.":[19],"However,":[20],"most":[21,36],"performance":[22,41,53,64,73,171],"metrics":[23,37],"assume":[24],"that":[25],"knowledge":[27],"exact":[30],"Pareto-optimal":[31],"is":[33,162,191],"available.":[34],"Also,":[35],"evaluate":[38],"algorithm's":[40],"based":[42,101],"on":[43,102],"final":[45],"set,":[47],"which":[48,66],"fails":[49],"to":[50,70,86,176],"capture":[51],"their":[52],"during":[54,77],"intermediate":[55],"generations.":[56],"In":[57,93],"this":[58,120],"paper,":[59],"we":[60,166],"investigate":[61],"running":[63,115,170],"metric":[65,116,172],"can":[67,173],"be":[68,87,174],"applied":[69],"measure":[71],"at":[74,193],"any":[75],"time":[76],"algorithm":[79],"execution":[80],"and":[81,132,139,144,151],"no":[82],"true":[83],"optimum":[84],"needs":[85],"known":[88],"for":[89],"computing":[90],"metric.":[92],"general,":[94],"algorithms":[96,181],"either":[97],"improve":[98],"convergence":[100,143],"dominance":[104],"relation":[105],"or":[106],"diversity":[108],"set.":[112],"Our":[113],"proposed":[114,189],"makes":[117],"use":[118],"fact":[121],"keeping":[123],"track":[124],"indicators":[127,156],"regarding":[128],"extreme":[130],"points":[131],"ND":[134],"each":[137,183],"generation":[138],"derives":[140],"measures":[141],"diversity.":[145],"Moreover,":[146],"introducing":[148],"threshold":[150],"comparing":[152],"values":[154],"termination":[160],"criteria":[161],"also":[163],"suggested.":[164],"Finally,":[165],"demonstrate":[167],"how":[168],"our":[169],"used":[175],"compare":[177],"multiple":[178],"with":[182],"other.":[184],"An":[185],"implementation":[186],"methodology":[190],"available":[192],"pymoo,":[194],"optimization":[197],"framework:":[198],"https://pymoo.org.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}