{"id":"https://openalex.org/W2921731618","doi":"https://doi.org/10.1109/istel.2018.8660978","title":"Graph-based Clustering for Multi-objective Evolutionary Algorithm","display_name":"Graph-based Clustering for Multi-objective Evolutionary Algorithm","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2921731618","doi":"https://doi.org/10.1109/istel.2018.8660978","mag":"2921731618"},"language":"en","primary_location":{"id":"doi:10.1109/istel.2018.8660978","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istel.2018.8660978","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 9th International Symposium on Telecommunications (IST)","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/A5079693149","display_name":"Siamak Ghodsi","orcid":"https://orcid.org/0000-0002-3306-4233"},"institutions":[{"id":"https://openalex.org/I3124704065","display_name":"University of Kurdistan","ror":"https://ror.org/04k89yk85","country_code":"IR","type":"education","lineage":["https://openalex.org/I3124704065"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"S. Siamak Ghodsi","raw_affiliation_strings":["Department of Computer Engineering, University of Kurdistan, Sanandaj, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, University of Kurdistan, Sanandaj, Iran","institution_ids":["https://openalex.org/I3124704065"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063995470","display_name":"Parham Moradi","orcid":"https://orcid.org/0000-0002-5604-565X"},"institutions":[{"id":"https://openalex.org/I3124704065","display_name":"University of Kurdistan","ror":"https://ror.org/04k89yk85","country_code":"IR","type":"education","lineage":["https://openalex.org/I3124704065"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Parham Moradi","raw_affiliation_strings":["Department of Computer Engineering, University of Kurdistan, Sanandaj, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, University of Kurdistan, Sanandaj, Iran","institution_ids":["https://openalex.org/I3124704065"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063584452","display_name":"Sahar Tahmasebi","orcid":"https://orcid.org/0000-0003-4784-7391"},"institutions":[{"id":"https://openalex.org/I3124704065","display_name":"University of Kurdistan","ror":"https://ror.org/04k89yk85","country_code":"IR","type":"education","lineage":["https://openalex.org/I3124704065"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Sahar Tahmasebi","raw_affiliation_strings":["Department of Computer Engineering, University of Kurdistan, Sanandaj, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, University of Kurdistan, Sanandaj, Iran","institution_ids":["https://openalex.org/I3124704065"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5079693149"],"corresponding_institution_ids":["https://openalex.org/I3124704065"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22879535,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"624","last_page":"629"},"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.9993000030517578,"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.9894999861717224,"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/computer-science","display_name":"Computer science","score":0.6766242384910583},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6620703339576721},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5920302867889404},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.551019549369812},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.5263296961784363},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5170331597328186},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4815109670162201},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40203532576560974},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3921283483505249},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36436623334884644},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2960944175720215},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21607166528701782}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6766242384910583},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6620703339576721},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5920302867889404},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.551019549369812},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5263296961784363},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5170331597328186},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4815109670162201},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40203532576560974},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3921283483505249},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36436623334884644},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2960944175720215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21607166528701782},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/istel.2018.8660978","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istel.2018.8660978","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 9th International Symposium on Telecommunications (IST)","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":23,"referenced_works":["https://openalex.org/W1492403673","https://openalex.org/W1558919105","https://openalex.org/W1588375755","https://openalex.org/W1605170913","https://openalex.org/W1905847227","https://openalex.org/W2012536979","https://openalex.org/W2022485595","https://openalex.org/W2038420231","https://openalex.org/W2044258615","https://openalex.org/W2052458054","https://openalex.org/W2075170310","https://openalex.org/W2108968575","https://openalex.org/W2116661285","https://openalex.org/W2126105956","https://openalex.org/W2128357515","https://openalex.org/W2129012762","https://openalex.org/W2143185749","https://openalex.org/W2143381319","https://openalex.org/W2150046657","https://openalex.org/W2155019998","https://openalex.org/W2158078084","https://openalex.org/W4255176593","https://openalex.org/W6635433731"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W85101999","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W4291270682","https://openalex.org/W1560122427","https://openalex.org/W2593449396","https://openalex.org/W2780789525","https://openalex.org/W2121903617"],"abstract_inverted_index":{"Multi-objective":[0],"optimization":[1,10,31,40],"is":[2,99],"a":[3,29,35,59,73,94,100],"challenging":[4],"task":[5],"in":[6,93],"artificial":[7],"intelligence":[8],"and":[9,125],"field,":[11],"as":[12],"it":[13,52,69,90],"deals":[14],"with":[15,116],"multiple":[16],"conflicting":[17],"objectives":[18],"to":[19,58,111,132],"be":[20],"optimized.":[21],"This":[22],"paper":[23],"suggests":[24],"an":[25],"approach":[26],"for":[27],"decomposing":[28],"multi-objective":[30,39,118],"problem":[32],"(MOP)":[33],"into":[34,72],"number":[36],"of":[37,48,67,75,87,127],"simple":[38],"sub-problems.":[41,83],"The":[42],"proposed":[43,114,129],"method":[44,115,130],"takes":[45],"the":[46,55,64,85,113,123,128,133],"advantage":[47],"nearest":[49],"neighbor":[50],"algorithm.":[51],"first":[53],"maps":[54],"evolutionary":[56,119],"population":[57,68],"kNN":[60],"graph":[61],"then":[62],"using":[63],"local":[65],"traits":[66],"divides":[70],"them":[71],"set":[74],"smaller":[76],"fixed":[77],"size":[78],"clusters.":[79],"These":[80],"clusters":[81],"become":[82],"With":[84],"use":[86],"these":[88],"sub-problems":[89],"solves":[91],"MOPs":[92],"collaborative":[95],"way.":[96],"Each":[97],"sub-population":[98],"cluster":[101],"that":[102],"receives":[103],"computational":[104],"effort":[105],"separately.":[106],"Experiments":[107],"have":[108],"been":[109],"conducted":[110],"compare":[112],"state-of-the-art":[117],"algorithms,":[120],"results":[121],"show":[122],"effectiveness":[124],"superiority":[126],"compared":[131],"other":[134],"ones.":[135]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}