{"id":"https://openalex.org/W1923459427","doi":"https://doi.org/10.1109/ecai.2015.7301163","title":"Adaptive mutation in genetic algorithms for shortest path routing problem","display_name":"Adaptive mutation in genetic algorithms for shortest path routing problem","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1923459427","doi":"https://doi.org/10.1109/ecai.2015.7301163","mag":"1923459427"},"language":"en","primary_location":{"id":"doi:10.1109/ecai.2015.7301163","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecai.2015.7301163","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 7th International Conference on Electronics, Computers and Artificial Intelligence (ECAI)","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/A5028788677","display_name":"Rares Maniu","orcid":null},"institutions":[{"id":"https://openalex.org/I2802885015","display_name":"Military Technical Academy","ror":"https://ror.org/01tqmsq19","country_code":"RO","type":"education","lineage":["https://openalex.org/I2802885015"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Maniu Rares","raw_affiliation_strings":["Military Technical Academy, Bucharest, Romania","Military Technical Academy , Bucharest , Romania"],"affiliations":[{"raw_affiliation_string":"Military Technical Academy, Bucharest, Romania","institution_ids":["https://openalex.org/I2802885015"]},{"raw_affiliation_string":"Military Technical Academy , Bucharest , Romania","institution_ids":["https://openalex.org/I2802885015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028788677"],"corresponding_institution_ids":["https://openalex.org/I2802885015"],"apc_list":null,"apc_paid":null,"fwci":0.6656,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.73426874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"S","last_page":"69"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9987999796867371,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9987999796867371,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7220019102096558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6646948456764221},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6626975536346436},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6021326184272766},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.5825810432434082},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5627972483634949},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.549791693687439},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5484455823898315},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5341089963912964},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.509002685546875},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.45327436923980713},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4430449903011322},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41301143169403076},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40705162286758423},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.35983437299728394},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2621490955352783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21184614300727844},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1930123269557953},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.19195571541786194},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.13590934872627258},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1221674382686615},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.0948466956615448},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.09245190024375916},{"id":"https://openalex.org/keywords/gene","display_name":"Gene","score":0.06688010692596436}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7220019102096558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6646948456764221},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6626975536346436},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6021326184272766},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.5825810432434082},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5627972483634949},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.549791693687439},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5484455823898315},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5341089963912964},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.509002685546875},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.45327436923980713},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4430449903011322},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41301143169403076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40705162286758423},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.35983437299728394},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2621490955352783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21184614300727844},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1930123269557953},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.19195571541786194},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13590934872627258},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1221674382686615},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0948466956615448},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.09245190024375916},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.06688010692596436},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ecai.2015.7301163","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecai.2015.7301163","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 7th International Conference on Electronics, Computers and Artificial Intelligence (ECAI)","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":4,"referenced_works":["https://openalex.org/W2117473144","https://openalex.org/W2151318312","https://openalex.org/W2341965649","https://openalex.org/W6704527479"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W1997440971","https://openalex.org/W2064711473","https://openalex.org/W1618717300","https://openalex.org/W1515277195","https://openalex.org/W2121598558","https://openalex.org/W1971025399","https://openalex.org/W1976420359"],"abstract_inverted_index":{"In":[0],"a":[1,6],"high":[2,7,18],"evolving":[3],"networks,":[4,51],"with":[5,81],"load":[8],"of":[9,77],"traffic,":[10],"the":[11,32,47,70,75],"classic":[12],"shortest":[13,48],"path":[14,34,49],"routing":[15,33],"algorithms":[16],"are":[17],"time-consuming":[19],"and":[20,63],"it":[21],"cause":[22],"performance":[23,76],"degradation":[24],"for":[25],"network":[26],"if":[27],"is":[28],"impossible":[29],"to":[30,45],"generate":[31],"in":[35,50,58],"timely":[36],"manner.":[37],"This":[38],"paper":[39],"proposes":[40],"an":[41,53],"improved":[42],"genetic":[43,78,83],"algorithm":[44],"find":[46],"using":[52],"adaptive":[54],"mutation":[55,72],"operator,":[56],"taking":[57],"consideration":[59],"both":[60],"on":[61],"genotypic":[62],"phenotypic":[64],"level.":[65],"Experimental":[66],"results":[67],"show":[68],"that":[69],"new":[71],"operator":[73],"improves":[74],"algorithm,":[79],"compared":[80],"standard":[82],"algorithm.":[84]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}