{"id":"https://openalex.org/W2782577096","doi":"https://doi.org/10.1109/tcyb.2017.2789158","title":"An Efficient Nondominated Sorting Algorithm for Large Number of Fronts","display_name":"An Efficient Nondominated Sorting Algorithm for Large Number of Fronts","publication_year":2018,"publication_date":"2018-01-12","ids":{"openalex":"https://openalex.org/W2782577096","doi":"https://doi.org/10.1109/tcyb.2017.2789158","mag":"2782577096","pmid":"https://pubmed.ncbi.nlm.nih.gov/29994360"},"language":"en","primary_location":{"id":"doi:10.1109/tcyb.2017.2789158","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2017.2789158","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103034667","display_name":"Proteek Chandan Roy","orcid":"https://orcid.org/0000-0002-1646-9239"},"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":"Proteek Chandan Roy","raw_affiliation_strings":["Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA"],"raw_orcid":"https://orcid.org/0000-0002-1646-9239","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"middle","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":["Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI, USA"],"raw_orcid":"https://orcid.org/0000-0001-7402-9939","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100319160","display_name":"Md. Monirul Islam","orcid":"https://orcid.org/0000-0002-8998-2850"},"institutions":[{"id":"https://openalex.org/I183697816","display_name":"Bangladesh University of Engineering and Technology","ror":"https://ror.org/05a1qpv97","country_code":"BD","type":"education","lineage":["https://openalex.org/I183697816"]}],"countries":["BD"],"is_corresponding":false,"raw_author_name":"Md. Monirul Islam","raw_affiliation_strings":["Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh"],"raw_orcid":"https://orcid.org/0000-0002-8998-2850","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh","institution_ids":["https://openalex.org/I183697816"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.1508,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.9614773,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"49","issue":"3","first_page":"859","last_page":"869"},"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.9998000264167786,"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.9998000264167786,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9998000264167786,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9984999895095825,"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/sort","display_name":"sort","score":0.7741636633872986},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7446035146713257},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.6836239099502563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5785030722618103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5033809542655945},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4984300136566162},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4977753460407257},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48328688740730286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4530574381351471},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45262759923934937},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4122537672519684},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1729593575000763},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.08199390769004822}],"concepts":[{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.7741636633872986},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7446035146713257},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.6836239099502563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5785030722618103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5033809542655945},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4984300136566162},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4977753460407257},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48328688740730286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4530574381351471},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45262759923934937},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4122537672519684},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1729593575000763},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08199390769004822}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tcyb.2017.2789158","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2017.2789158","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:29994360","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/29994360","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}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7414076325","display_name":null,"funder_award_id":"DBI-0939454","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310016","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993"},{"id":"https://openalex.org/F4320322835","display_name":"Ministry of Economic Affairs","ror":"https://ror.org/042ge0913"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1235360365","https://openalex.org/W1490019115","https://openalex.org/W1517348552","https://openalex.org/W1559701175","https://openalex.org/W1570937420","https://openalex.org/W1595498733","https://openalex.org/W1670300334","https://openalex.org/W1833634424","https://openalex.org/W1846834309","https://openalex.org/W1905847227","https://openalex.org/W1957430778","https://openalex.org/W1964669678","https://openalex.org/W1972208891","https://openalex.org/W1992212078","https://openalex.org/W2021418037","https://openalex.org/W2022485595","https://openalex.org/W2028772559","https://openalex.org/W2035101851","https://openalex.org/W2042011228","https://openalex.org/W2042235527","https://openalex.org/W2049864887","https://openalex.org/W2072661909","https://openalex.org/W2103427656","https://openalex.org/W2111589951","https://openalex.org/W2116661285","https://openalex.org/W2117852087","https://openalex.org/W2118246375","https://openalex.org/W2123808725","https://openalex.org/W2126105956","https://openalex.org/W2126997347","https://openalex.org/W2143185749","https://openalex.org/W2158320871","https://openalex.org/W2170188482","https://openalex.org/W2477866957","https://openalex.org/W2479764006","https://openalex.org/W2502273082","https://openalex.org/W2551043114","https://openalex.org/W2557726231","https://openalex.org/W2588308923","https://openalex.org/W2724304276","https://openalex.org/W2732611290","https://openalex.org/W2994964425","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W4285719527","https://openalex.org/W4302571648","https://openalex.org/W6630873004","https://openalex.org/W6771627385"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W2095055219","https://openalex.org/W2482527088","https://openalex.org/W3033694952","https://openalex.org/W2908348257","https://openalex.org/W4392178020","https://openalex.org/W2085265870","https://openalex.org/W2362374543","https://openalex.org/W2348196682","https://openalex.org/W3002909018"],"abstract_inverted_index":{"Nondominated":[0],"sorting":[1,71],"is":[2,19,27,34,45,125,139,171,181,195,207,233,266],"a":[3,62,99,112,123,134,228],"key":[4],"operation":[5],"used":[6],"in":[7,188,227],"multiobjective":[8],"evolutionary":[9],"algorithms":[10,41],"(MOEA).":[11],"Worst":[12],"case":[13,55,149,193,204,214],"time":[14,205],"complexity":[15,150,194,206,215],"of":[16,30,37,68,81,102,122,142,169,177],"this":[17,58],"algorithm":[18,50,64,72],"O(MN":[20,197],"<sup":[21,198,219],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[22,157,161,184,199,220],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[23,200,221],"),":[24,222],"where":[25,166],"N":[26,218],"the":[28,35,117,120,147,167,174,212],"number":[29,36,141,168,176],"solutions":[31,178,225],"and":[32,87,173,249],"M":[33],"objectives.":[38],"For":[39],"stochastic":[40],"like":[42],"MOEAs,":[43],"it":[44],"important":[46],"to":[47,73,91,154],"devise":[48],"an":[49],"which":[51],"has":[52],"better":[53],"average":[54],"performance.":[56],"In":[57],"paper,":[59],"we":[60],"propose":[61,98],"new":[63],"that":[65,104,146,258],"makes":[66],"use":[67,88],"faster":[69],"scalar":[70],"perform":[74],"nondominated":[75,247],"sorting.":[76],"It":[77,127],"finds":[78],"partial":[79],"orders":[80,90],"each":[82],"solution":[83,94,124],"from":[84],"all":[85,224,271],"objectives":[86,103],"these":[89],"skip":[92],"unnecessary":[93],"comparisons.":[95,107],"We":[96,144,209],"also":[97,210],"specific":[100],"order":[101,264],"reduces":[105,129],"objective":[106],"The":[108],"proposed":[109],"method":[110,232],"introduces":[111],"weighted":[113],"binary":[114],"search":[115],"over":[116],"fronts":[118,170],"when":[119,137,223],"rank":[121],"determined.":[126],"further":[128],"total":[130],"computational":[131],"effort":[132],"by":[133],"large":[135,140],"factor":[136],"there":[138],"fronts.":[143],"prove":[145],"worst":[148,192],"can":[151],"be":[152],"reduced":[153],"\u0398(MNC":[155],"<sub":[156,160,183],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">max</sub>":[158,185],"log":[159],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[162],"(F":[163],"+":[164,217],"1)),":[165],"F":[172],"maximum":[175],"per":[179],"front":[180],"C":[182],";":[186],"however,":[187],"general":[189],"cases,":[190],"our":[191,259],"still":[196],").":[201],"Our":[202],"best":[203,213,263],"O(MNlogN).":[208],"achieve":[211],"O(MNlogN":[216],"are":[226],"single":[229],"front.":[230],"This":[231],"compared":[234],"with":[235],"other":[236,272],"state-of-the-art":[237],"algorithms-efficient":[238],"nondomination":[239],"level":[240],"update,":[241],"deductive":[242],"sort,":[243,245,265],"corner":[244],"efficient":[246,269],"sort":[248],"divide-and-conquer":[250],"sort-in":[251],"four":[252],"different":[253],"datasets.":[254],"Experimental":[255],"results":[256],"show":[257],"method,":[260],"namely,":[261],"bounded":[262],"computationally":[267],"more":[268],"than":[270],"competing":[273],"algorithms.":[274]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}