{"id":"https://openalex.org/W1983718980","doi":"https://doi.org/10.1109/icccn.2013.6614105","title":"An Elitist Polynomial Mutation Operator for Improved Performance of MOEAs in Computer Networks","display_name":"An Elitist Polynomial Mutation Operator for Improved Performance of MOEAs in Computer Networks","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W1983718980","doi":"https://doi.org/10.1109/icccn.2013.6614105","mag":"1983718980"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2013.6614105","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2013.6614105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","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/A5054121476","display_name":"K. Liagkouras","orcid":"https://orcid.org/0000-0002-7891-9610"},"institutions":[{"id":"https://openalex.org/I154757721","display_name":"University of Piraeus","ror":"https://ror.org/02qs84g94","country_code":"GR","type":"education","lineage":["https://openalex.org/I154757721"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"K. Liagkouras","raw_affiliation_strings":["Department of Informatics, University of Piraeus, Piraeus, Greece","Dept. of Inf., Univ. of Piraeus, Piraeus, Greece#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Piraeus, Piraeus, Greece","institution_ids":["https://openalex.org/I154757721"]},{"raw_affiliation_string":"Dept. of Inf., Univ. of Piraeus, Piraeus, Greece#TAB#","institution_ids":["https://openalex.org/I154757721"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111590670","display_name":"Kostas Metaxiotis","orcid":null},"institutions":[{"id":"https://openalex.org/I154757721","display_name":"University of Piraeus","ror":"https://ror.org/02qs84g94","country_code":"GR","type":"education","lineage":["https://openalex.org/I154757721"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"K. Metaxiotis","raw_affiliation_strings":["Department of Informatics, University of Piraeus, Piraeus, Greece","Dept. of Inf., Univ. of Piraeus, Piraeus, Greece#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Piraeus, Piraeus, Greece","institution_ids":["https://openalex.org/I154757721"]},{"raw_affiliation_string":"Dept. of Inf., Univ. of Piraeus, Piraeus, Greece#TAB#","institution_ids":["https://openalex.org/I154757721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154757721"],"apc_list":null,"apc_paid":null,"fwci":1.9064,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.84286964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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.9991999864578247,"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.991599977016449,"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/mutation","display_name":"Mutation","score":0.7234066128730774},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.6549160480499268},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6502195596694946},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6225861310958862},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5645259022712708},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.5565167665481567},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5117583274841309},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.45798221230506897},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4157334566116333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4140850901603699},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35090479254722595},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.09463030099868774},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.08715015649795532}],"concepts":[{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.7234066128730774},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.6549160480499268},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6502195596694946},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6225861310958862},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5645259022712708},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5565167665481567},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5117583274841309},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.45798221230506897},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4157334566116333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4140850901603699},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35090479254722595},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.09463030099868774},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.08715015649795532},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2013.6614105","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2013.6614105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W225560312","https://openalex.org/W1522538275","https://openalex.org/W1525375343","https://openalex.org/W1689025679","https://openalex.org/W2000825106","https://openalex.org/W2008002935","https://openalex.org/W2098907614","https://openalex.org/W2106334424","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2941281702","https://openalex.org/W6608886761","https://openalex.org/W6631460888"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W85101999","https://openalex.org/W2145877535","https://openalex.org/W2744730182","https://openalex.org/W3134440233","https://openalex.org/W2751605210","https://openalex.org/W2068949283"],"abstract_inverted_index":{"Polynomial":[0],"mutation":[1,79,83],"has":[2,49],"been":[3,50],"utilized":[4],"in":[5,52,87,95],"evolutionary":[6,20,91],"optimization":[7],"algorithms":[8,21],"as":[9],"a":[10,88],"variation":[11],"operator.":[12],"In":[13,33],"previous":[14],"work":[15],"on":[16],"the":[17,39,45,53,65,75,81],"use":[18],"of":[19,28,42,56,64,97,100],"for":[22],"solving":[23],"multiobjective":[24,92],"problems,":[25],"two":[26],"versions":[27],"polynomial":[29,43,68,78],"mutations":[30],"were":[31],"introduced.":[32],"this":[34],"study":[35],"we":[36],"will":[37],"examine":[38],"latest":[40,54],"version":[41,55,63],"mutation,":[44],"highly":[46,66],"disruptive,":[47],"which":[48],"utilised":[51],"NSGA-II.":[57],"This":[58],"paper":[59],"proposes":[60],"an":[61],"elitist":[62,77],"disruptive":[67],"mutation.":[69],"The":[70],"experimental":[71],"results":[72],"show":[73],"that":[74],"proposed":[76],"outperforms":[80],"existing":[82],"mechanism":[84],"when":[85],"applied":[86],"well":[89],"known":[90],"algorithm":[93],"(NSGA-II)":[94],"terms":[96],"hypervolume,":[98],"spread":[99],"solutions":[101],"and":[102],"epsilon":[103],"performance":[104],"indicator.":[105]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}