{"id":"https://openalex.org/W2064592000","doi":"https://doi.org/10.1142/s021812661550067x","title":"A Reduced Uncertainty-Based Hybrid Evolutionary Algorithm for Solving Dynamic Shortest-Path Routing Problem","display_name":"A Reduced Uncertainty-Based Hybrid Evolutionary Algorithm for Solving Dynamic Shortest-Path Routing Problem","publication_year":2015,"publication_date":"2015-02-18","ids":{"openalex":"https://openalex.org/W2064592000","doi":"https://doi.org/10.1142/s021812661550067x","mag":"2064592000"},"language":"en","primary_location":{"id":"doi:10.1142/s021812661550067x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021812661550067x","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-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/A5044120766","display_name":"H\u00fcseyin Kuseto\u011fullar\u0131","orcid":"https://orcid.org/0000-0001-5762-6678"},"institutions":[{"id":"https://openalex.org/I149028718","display_name":"Gediz University","ror":"https://ror.org/0251p9z15","country_code":"TR","type":"education","lineage":["https://openalex.org/I149028718"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Huseyin Kusetogullari","raw_affiliation_strings":["Department of Computer Engineering, Gediz University, Seyrek, Izmir, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Gediz University, Seyrek, Izmir, Turkey","institution_ids":["https://openalex.org/I149028718"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011508203","display_name":"Md. Haidar Sharif","orcid":"https://orcid.org/0000-0001-7235-6004"},"institutions":[{"id":"https://openalex.org/I149028718","display_name":"Gediz University","ror":"https://ror.org/0251p9z15","country_code":"TR","type":"education","lineage":["https://openalex.org/I149028718"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Md. Haidar Sharif","raw_affiliation_strings":["Department of Computer Engineering, Gediz University, Seyrek, Izmir, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Gediz University, Seyrek, Izmir, Turkey","institution_ids":["https://openalex.org/I149028718"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056656974","display_name":"Mark S. Leeson","orcid":"https://orcid.org/0000-0003-0367-6228"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mark S. Leeson","raw_affiliation_strings":["The School of Engineering, Warwick University, Coventry, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The School of Engineering, Warwick University, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049945687","display_name":"Turgay \u00c7elik","orcid":"https://orcid.org/0000-0001-6925-6010"},"institutions":[{"id":"https://openalex.org/I192619145","display_name":"University of the Witwatersrand","ror":"https://ror.org/03rp50x72","country_code":"ZA","type":"education","lineage":["https://openalex.org/I192619145"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Turgay Celik","raw_affiliation_strings":["School of Computer Science, University of the Witwatersrand, Johannesburg, South Africa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of the Witwatersrand, Johannesburg, South Africa","institution_ids":["https://openalex.org/I192619145"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6415,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.73048026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"24","issue":"05","first_page":"1550067","last_page":"1550067"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9900000095367432,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6910403966903687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6540564298629761},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6079754829406738},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.591435432434082},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5586696267127991},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5341832637786865},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5118545889854431},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.508908748626709},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4729604125022888},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4603220820426941},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42352044582366943},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4230808913707733},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22071558237075806},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1543208360671997},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07433924078941345}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6910403966903687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6540564298629761},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6079754829406738},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.591435432434082},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5586696267127991},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5341832637786865},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5118545889854431},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.508908748626709},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4729604125022888},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4603220820426941},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42352044582366943},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4230808913707733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22071558237075806},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1543208360671997},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07433924078941345},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s021812661550067x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021812661550067x","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:73771","is_oa":false,"landing_page_url":"http://wrap.warwick.ac.uk/73771/1/WRAP_J76.pdf","pdf_url":"http://wrap.warwick.ac.uk/73771/1/WRAP_J76.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":75,"referenced_works":["https://openalex.org/W108703714","https://openalex.org/W794717999","https://openalex.org/W1496379777","https://openalex.org/W1512043027","https://openalex.org/W1554407673","https://openalex.org/W1963916765","https://openalex.org/W1964005729","https://openalex.org/W1964241126","https://openalex.org/W1964874140","https://openalex.org/W1974758710","https://openalex.org/W1986129478","https://openalex.org/W1989111470","https://openalex.org/W2000950277","https://openalex.org/W2004317773","https://openalex.org/W2004524366","https://openalex.org/W2017903413","https://openalex.org/W2023766747","https://openalex.org/W2025126377","https://openalex.org/W2025917996","https://openalex.org/W2028006312","https://openalex.org/W2029006297","https://openalex.org/W2032558547","https://openalex.org/W2036714085","https://openalex.org/W2036893104","https://openalex.org/W2044712659","https://openalex.org/W2048189453","https://openalex.org/W2054264388","https://openalex.org/W2056531506","https://openalex.org/W2061554433","https://openalex.org/W2063896698","https://openalex.org/W2071131715","https://openalex.org/W2072818477","https://openalex.org/W2077654972","https://openalex.org/W2085031195","https://openalex.org/W2089086609","https://openalex.org/W2093709925","https://openalex.org/W2104564945","https://openalex.org/W2112700035","https://openalex.org/W2114793344","https://openalex.org/W2115012618","https://openalex.org/W2117051214","https://openalex.org/W2117402659","https://openalex.org/W2117473144","https://openalex.org/W2119926658","https://openalex.org/W2121044470","https://openalex.org/W2125332715","https://openalex.org/W2126166149","https://openalex.org/W2127616736","https://openalex.org/W2128110222","https://openalex.org/W2131046448","https://openalex.org/W2131140420","https://openalex.org/W2131202986","https://openalex.org/W2131228914","https://openalex.org/W2139476228","https://openalex.org/W2142183404","https://openalex.org/W2147322318","https://openalex.org/W2148653444","https://openalex.org/W2152938409","https://openalex.org/W2153153297","https://openalex.org/W2155529731","https://openalex.org/W2156501516","https://openalex.org/W2164531580","https://openalex.org/W2165985601","https://openalex.org/W2169284845","https://openalex.org/W2169423175","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2543580944","https://openalex.org/W2728019715","https://openalex.org/W2762935521","https://openalex.org/W2768149714","https://openalex.org/W2796856748","https://openalex.org/W4241727697","https://openalex.org/W4245608963","https://openalex.org/W4301173492"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W2375775343","https://openalex.org/W1990043277","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W2364137215","https://openalex.org/W2388410942"],"abstract_inverted_index":{"The":[0],"need":[1,15],"of":[2,68,78,87,129,156],"effective":[3],"packet":[4],"transmission":[5],"to":[6,16,34,59,80,125,148,150],"deliver":[7],"advanced":[8],"performance":[9,128],"in":[10,83,105,159],"wireless":[11],"networks":[12],"creates":[13],"the":[14,61,65,127,143,160],"find":[17,60],"shortest":[18,37],"network":[19],"paths":[20],"efficiently":[21],"and":[22,43,48,74,92,108],"quickly.":[23],"This":[24],"paper":[25],"addresses":[26],"a":[27,56,98,113],"reduced":[28],"uncertainty-based":[29],"hybrid":[30,57],"evolutionary":[31],"algorithm":[32,46,58],"(RUBHEA)":[33],"solve":[35],"dynamic":[36],"path":[38],"routing":[39],"problem":[40],"(DSPRP)":[41],"effectively":[42],"rapidly.":[44],"Genetic":[45],"(GA)":[47],"particle":[49],"swarm":[50],"optimization":[51],"(PSO)":[52],"are":[53,90,110],"integrated":[54],"as":[55,112],"best":[62],"solution":[63,115],"within":[64],"search":[66,88],"space":[67,89],"dynamically":[69],"changing":[70],"networks.":[71,161],"Both":[72],"GA":[73,107],"PSO":[75,109],"share":[76],"context":[77],"individuals":[79],"reduce":[81],"uncertainty":[82],"RUBHEA.":[84,95],"Various":[85],"regions":[86],"explored":[91],"learned":[93],"by":[94,146],"By":[96],"employing":[97],"modified":[99],"priority":[100],"encoding":[101],"method,":[102],"each":[103],"individual":[104],"both":[106],"represented":[111],"potential":[114],"for":[116],"DSPRP.":[117],"A":[118],"complete":[119],"statistical":[120],"analysis":[121],"has":[122],"been":[123],"performed":[124],"compare":[126],"RUBHEA":[130,138],"with":[131,153],"various":[132],"state-of-the-art":[133],"algorithms.":[134],"It":[135],"shows":[136],"that":[137],"is":[139],"considerably":[140],"superior":[141],"(reducing":[142],"failure":[144],"rate":[145],"up":[147],"50%)":[149],"similar":[151],"approaches":[152],"increasing":[154],"number":[155],"nodes":[157],"encountered":[158]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}