{"id":"https://openalex.org/W4387914352","doi":"https://doi.org/10.1109/codit58514.2023.10284357","title":"An Efficient Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization","display_name":"An Efficient Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization","publication_year":2023,"publication_date":"2023-07-03","ids":{"openalex":"https://openalex.org/W4387914352","doi":"https://doi.org/10.1109/codit58514.2023.10284357"},"language":"en","primary_location":{"id":"doi:10.1109/codit58514.2023.10284357","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit58514.2023.10284357","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","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/A5040931960","display_name":"Abir Chaabani","orcid":"https://orcid.org/0000-0003-0283-6111"},"institutions":[{"id":"https://openalex.org/I237446400","display_name":"Institut Superieur de Gestion","ror":"https://ror.org/035fsmk47","country_code":"FR","type":"education","lineage":["https://openalex.org/I237446400"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Abir Chaabani","raw_affiliation_strings":["ISGT, Universit&#x00E9; de Tunis,SMART Lab,Tunisie"],"affiliations":[{"raw_affiliation_string":"ISGT, Universit&#x00E9; de Tunis,SMART Lab,Tunisie","institution_ids":["https://openalex.org/I237446400"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088836999","display_name":"Mouna Karaja","orcid":"https://orcid.org/0000-0003-4526-7051"},"institutions":[{"id":"https://openalex.org/I237446400","display_name":"Institut Superieur de Gestion","ror":"https://ror.org/035fsmk47","country_code":"FR","type":"education","lineage":["https://openalex.org/I237446400"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mouna Karaja","raw_affiliation_strings":["ISGT, Universit&#x00E9; de Tunis,SMART Lab,Tunisie"],"affiliations":[{"raw_affiliation_string":"ISGT, Universit&#x00E9; de Tunis,SMART Lab,Tunisie","institution_ids":["https://openalex.org/I237446400"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028612749","display_name":"Lamjed Ben Sa\u00efd","orcid":"https://orcid.org/0000-0001-9225-884X"},"institutions":[{"id":"https://openalex.org/I237446400","display_name":"Institut Superieur de Gestion","ror":"https://ror.org/035fsmk47","country_code":"FR","type":"education","lineage":["https://openalex.org/I237446400"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lamjed Ben Said","raw_affiliation_strings":["ISGT, Universit&#x00E9; de Tunis,SMART Lab,Tunisie"],"affiliations":[{"raw_affiliation_string":"ISGT, Universit&#x00E9; de Tunis,SMART Lab,Tunisie","institution_ids":["https://openalex.org/I237446400"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040931960"],"corresponding_institution_ids":["https://openalex.org/I237446400"],"apc_list":null,"apc_paid":null,"fwci":0.4029,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66193741,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1565","last_page":"1570"},"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.9977999925613403,"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.9954000115394592,"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/sorting","display_name":"Sorting","score":0.8591817021369934},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.728679895401001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6198978424072266},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6095675230026245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5776242613792419},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.5167500376701355},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5151975750923157},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.46380165219306946},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.446085125207901},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36448216438293457},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33560431003570557},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31583550572395325},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2783232629299164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23063096404075623},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.20581495761871338}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.8591817021369934},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.728679895401001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6198978424072266},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6095675230026245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5776242613792419},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.5167500376701355},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5151975750923157},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.46380165219306946},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.446085125207901},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36448216438293457},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33560431003570557},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31583550572395325},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2783232629299164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23063096404075623},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.20581495761871338},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","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},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit58514.2023.10284357","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit58514.2023.10284357","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","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":17,"referenced_works":["https://openalex.org/W1553373771","https://openalex.org/W1588375755","https://openalex.org/W1595498733","https://openalex.org/W1599011794","https://openalex.org/W2000825106","https://openalex.org/W2054095119","https://openalex.org/W2079881116","https://openalex.org/W2096166399","https://openalex.org/W2102365077","https://openalex.org/W2123485079","https://openalex.org/W2126105956","https://openalex.org/W2127950596","https://openalex.org/W2143381319","https://openalex.org/W2148615815","https://openalex.org/W2477866957","https://openalex.org/W3091163952","https://openalex.org/W6635663304"],"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/W2994182992","https://openalex.org/W2085265870","https://openalex.org/W2362374543","https://openalex.org/W2348196682"],"abstract_inverted_index":{"Multi-Objective":[0],"Evolutionary":[1],"Algorithms":[2],"(MOEAs)":[3],"is":[4,56,74,125],"actually":[5],"one":[6],"of":[7,53,87,122,143,152],"the":[8,51,107,119,123,130,147,150],"most":[9],"attractive":[10],"and":[11,68,149],"active":[12],"research":[13,19,31],"field":[14],"in":[15,23,43],"computer":[16],"science.":[17],"Significant":[18],"has":[20,39],"been":[21],"conducted":[22],"handling":[24],"complex":[25],"multi-objective":[26,138,154],"optimization":[27],"problems":[28,145],"within":[29],"this":[30,54,79,153],"area.":[32],"The":[33],"Non-Dominated":[34],"Sorting":[35],"Genetic":[36],"Algorithm":[37],"(NSGA-II)":[38],"garnered":[40],"significant":[41],"attention":[42],"various":[44],"domains,":[45],"emphasizing":[46],"its":[47],"specific":[48],"popularity.":[49],"However,":[50],"complexity":[52],"algorithm":[55,99,109,124],"found":[57],"to":[58],"be":[59],"<tex":[60,64,69],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[61,65,70],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(MN^{2})$</tex>":[62],"with":[63,100],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$M$</tex>":[66],"objectives":[67],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N$</tex>":[71],"solutions,":[72],"which":[73],"considered":[75],"computationally":[76],"demanding.":[77],"In":[78],"paper,":[80],"we":[81],"are":[82],"proposing":[83],"a":[84,112,141],"new":[85],"variant":[86],"NSGA-II":[88,108],"termed":[89],"(Efficient-NSGA-II)":[90],"based":[91],"on":[92,140],"our":[93],"recently":[94],"proposed":[95],"quick":[96],"non-dominated":[97],"sorting":[98],"quasi-linear":[101],"average":[102],"time":[103],"complexity;":[104],"thereby":[105],"making":[106],"efficient":[110],"from":[111],"computational":[113],"cost":[114],"viewpoint.":[115],"Experiments":[116],"demonstrate":[117],"that":[118],"improved":[120],"version":[121],"indeed":[126],"much":[127],"faster":[128],"than":[129],"previous":[131],"one.":[132],"Moreover,":[133],"comparisons":[134],"results":[135],"against":[136],"other":[137],"algorithms":[139],"variety":[142],"benchmark":[144],"show":[146],"effectiveness":[148],"efficiency":[151],"version.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}