{"id":"https://openalex.org/W3026407107","doi":"https://doi.org/10.1109/tcyb.2020.2988896","title":"Solving Many-Objective Optimization Problems by a Pareto-Based Evolutionary Algorithm With Preprocessing and a Penalty Mechanism","display_name":"Solving Many-Objective Optimization Problems by a Pareto-Based Evolutionary Algorithm With Preprocessing and a Penalty Mechanism","publication_year":2020,"publication_date":"2020-05-20","ids":{"openalex":"https://openalex.org/W3026407107","doi":"https://doi.org/10.1109/tcyb.2020.2988896","mag":"3026407107","pmid":"https://pubmed.ncbi.nlm.nih.gov/32452796"},"language":"en","primary_location":{"id":"doi:10.1109/tcyb.2020.2988896","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2020.2988896","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Cybernetics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.birmingham.ac.uk/en/publications/3679eeee-6e49-4da7-9451-b12296dd0d38","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yuan Liu","orcid":"https://orcid.org/0000-0002-3643-3575"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuan Liu","raw_affiliation_strings":["College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"],"raw_orcid":"https://orcid.org/0000-0002-3643-3575","affiliations":[{"raw_affiliation_string":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024385275","display_name":"Ningbo Zhu","orcid":"https://orcid.org/0000-0001-7913-2740"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ningbo Zhu","raw_affiliation_strings":["College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036335232","display_name":"Miqing Li","orcid":"https://orcid.org/0000-0002-8607-9607"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Miqing Li","raw_affiliation_strings":["Center of Excellence for Research in Computational Intelligence and Applications, School of Computer Science, University of Birmingham, Birmingham, U.K"],"raw_orcid":"https://orcid.org/0000-0002-8607-9607","affiliations":[{"raw_affiliation_string":"Center of Excellence for Research in Computational Intelligence and Applications, School of Computer Science, University of Birmingham, Birmingham, U.K","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0794,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.94936372,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"51","issue":"11","first_page":"5585","last_page":"5594"},"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.9958999752998352,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9919000267982483,"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/mechanism","display_name":"Mechanism (biology)","score":0.7027809023857117},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6281833648681641},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5888016223907471},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5860051512718201},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5829935073852539},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5658730268478394},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5459075570106506},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5302721261978149},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4878842830657959},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26534342765808105},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2444005310535431}],"concepts":[{"id":"https://openalex.org/C89611455","wikidata":"https://www.wikidata.org/wiki/Q6804646","display_name":"Mechanism (biology)","level":2,"score":0.7027809023857117},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6281833648681641},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5888016223907471},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5860051512718201},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5829935073852539},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5658730268478394},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5459075570106506},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5302721261978149},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4878842830657959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26534342765808105},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2444005310535431},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tcyb.2020.2988896","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2020.2988896","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Cybernetics","raw_type":"journal-article"},{"id":"pmid:32452796","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/32452796","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on cybernetics","raw_type":null},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/3679eeee-6e49-4da7-9451-b12296dd0d38","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/3679eeee-6e49-4da7-9451-b12296dd0d38","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Liu, Y, Zhu, N & Li, M 2021, 'Solving many-objective optimization problems by a Pareto-based evolutionary algorithm with preprocessing and a penalty mechanism', IEEE Transactions on Cybernetics, vol. 51, no. 11, pp. 5585-5594. https://doi.org/10.1109/TCYB.2020.2988896","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/3679eeee-6e49-4da7-9451-b12296dd0d38","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85116568580&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/3679eeee-6e49-4da7-9451-b12296dd0d38","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/3679eeee-6e49-4da7-9451-b12296dd0d38","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Liu, Y, Zhu, N & Li, M 2021, 'Solving many-objective optimization problems by a Pareto-based evolutionary algorithm with preprocessing and a penalty mechanism', IEEE Transactions on Cybernetics, vol. 51, no. 11, pp. 5585-5594. https://doi.org/10.1109/TCYB.2020.2988896","raw_type":"article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1328409166","display_name":null,"funder_award_id":"61625202","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G448203852","display_name":null,"funder_award_id":"61572177","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G882002931","display_name":null,"funder_award_id":"61661146006","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":64,"referenced_works":["https://openalex.org/W172566934","https://openalex.org/W225560312","https://openalex.org/W760913798","https://openalex.org/W1459461882","https://openalex.org/W1525375343","https://openalex.org/W1574672657","https://openalex.org/W1588375755","https://openalex.org/W1605170913","https://openalex.org/W1607221389","https://openalex.org/W1608919060","https://openalex.org/W1662894842","https://openalex.org/W1856614156","https://openalex.org/W1968075052","https://openalex.org/W2021418037","https://openalex.org/W2022485595","https://openalex.org/W2040622444","https://openalex.org/W2047923585","https://openalex.org/W2063375245","https://openalex.org/W2063425401","https://openalex.org/W2071694551","https://openalex.org/W2072661909","https://openalex.org/W2085507535","https://openalex.org/W2099585388","https://openalex.org/W2102365077","https://openalex.org/W2104456211","https://openalex.org/W2105511939","https://openalex.org/W2108968575","https://openalex.org/W2126997347","https://openalex.org/W2128357515","https://openalex.org/W2133787071","https://openalex.org/W2143185749","https://openalex.org/W2143381319","https://openalex.org/W2167145078","https://openalex.org/W2172250608","https://openalex.org/W2278123559","https://openalex.org/W2312339748","https://openalex.org/W2327866891","https://openalex.org/W2337108669","https://openalex.org/W2343601797","https://openalex.org/W2469950730","https://openalex.org/W2512033555","https://openalex.org/W2521918431","https://openalex.org/W2563621803","https://openalex.org/W2570235502","https://openalex.org/W2599937626","https://openalex.org/W2732724468","https://openalex.org/W2739082215","https://openalex.org/W2752752621","https://openalex.org/W2771169143","https://openalex.org/W2780725426","https://openalex.org/W2783781089","https://openalex.org/W2798139910","https://openalex.org/W2803349547","https://openalex.org/W2809762112","https://openalex.org/W2888291168","https://openalex.org/W2888338796","https://openalex.org/W2906115061","https://openalex.org/W2908622156","https://openalex.org/W2918702815","https://openalex.org/W2921981915","https://openalex.org/W2939164430","https://openalex.org/W2972080358","https://openalex.org/W3100195331","https://openalex.org/W6635433731"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W4241467429","https://openalex.org/W2001591765","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W2073147994","https://openalex.org/W2145877535","https://openalex.org/W1588199609","https://openalex.org/W2384474142","https://openalex.org/W2744730182"],"abstract_inverted_index":{"It":[0],"is":[1,7,23,185],"known":[2],"that":[3,121,204],"the":[4,52,55,59,62,65,68,87,92,95,98,115,126,145,151,161,205,214],"Pareto-based":[5,34,141],"approach":[6],"not":[8],"well":[9,210],"suited":[10],"for":[11],"optimization":[12,76],"problems":[13,77],"with":[14,78,187,197],"a":[15,24,33,40,46,103,139,172,192],"large":[16],"number":[17,193],"of":[18,26,64,94,175,194,213],"objectives,":[19],"even":[20],"though":[21],"it":[22],"class":[25],"mainstream":[27],"methods":[28],"in":[29,74],"multiobjective":[30],"optimization.":[31],"Typically,":[32],"algorithm":[35,142,184,207],"comprises":[36],"two":[37],"parts:":[38],"1)":[39],"Pareto":[41,69],"dominance-based":[42,70],"criterion":[43,71],"and":[44,168,180,217],"2)":[45],"diversity":[47,63,88,99],"estimator.":[48],"The":[49,182,200],"former":[50],"guides":[51],"selection":[53,179],"toward":[54,106],"optimal":[56],"front,":[57],"while":[58],"latter":[60],"promotes":[61],"population.":[66],"However,":[67],"becomes":[72],"ineffective":[73],"solving":[75],"many":[79],"objectives":[80],"(e.g.,":[81],"more":[82],"than":[83],"3)":[84],"and,":[85],"thus,":[86],"estimator":[89,100],"will":[90],"determine":[91],"performance":[93],"algorithm.":[96],"Unfortunately,":[97],"usually":[101],"has":[102],"strong":[104],"bias":[105],"dominance":[107],"resistance":[108],"solutions":[109,120],"(DRSs),":[110],"thereby":[111],"failing":[112],"to":[113,143,149,159,165],"push":[114],"population":[116],"forward.":[117],"DRSs":[118],"are":[119,122],"far":[123],"away":[124],"from":[125],"Pareto-optimal":[127],"front":[128],"but":[129],"cannot":[130],"be":[131],"easily":[132],"dominated.":[133],"In":[134],"this":[135],"article,":[136],"we":[137,153,170],"propose":[138],"new":[140],"resolve":[144],"above":[146],"issue.":[147],"First,":[148],"eliminate":[150],"DRSs,":[152],"design":[154],"an":[155],"interquartile":[156],"range":[157],"method":[158],"preprocess":[160],"solution":[162],"set.":[163],"Second,":[164],"balance":[166],"convergence":[167],"diversity,":[169],"present":[171],"penalty":[173],"mechanism":[174],"alternating":[176],"operations":[177],"between":[178],"penalty.":[181],"proposed":[183,206],"compared":[186],"five":[188],"state-of-the-art":[189],"algorithms":[190],"on":[191,211],"well-known":[195],"benchmarks":[196],"3-15":[198],"objectives.":[199],"experimental":[201],"results":[202],"show":[203],"can":[208],"perform":[209],"most":[212],"test":[215],"functions":[216],"generally":[218],"outperforms":[219],"its":[220],"competitors.":[221]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}