{"id":"https://openalex.org/W2558735631","doi":"https://doi.org/10.1109/cec.2016.7744313","title":"A multi-population memetic algorithm for dynamic shortest path routing in mobile ad-hoc networks","display_name":"A multi-population memetic algorithm for dynamic shortest path routing in mobile ad-hoc networks","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2558735631","doi":"https://doi.org/10.1109/cec.2016.7744313","mag":"2558735631"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744313","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5027252595","display_name":"Ayad Turky","orcid":"https://orcid.org/0000-0001-8415-7328"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ayad Turky","raw_affiliation_strings":["School of Computer Science and Information Technology, RMIT University, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Technology, RMIT University, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050621611","display_name":"Nasser R. Sabar","orcid":"https://orcid.org/0000-0002-0276-4704"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Nasser R. Sabar","raw_affiliation_strings":["School of Computer Science and Information Technology, RMIT University, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Technology, RMIT University, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056403144","display_name":"Andy Song","orcid":"https://orcid.org/0000-0002-7579-7048"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Andy Song","raw_affiliation_strings":["School of Computer Science and Information Technology, RMIT University, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Technology, RMIT University, Australia","institution_ids":["https://openalex.org/I82951845"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.235,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":15,"citation_normalized_percentile":{"value":0.764751,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":90},"biblio":{"volume":null,"issue":null,"first_page":"4119","last_page":"4126"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9995,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9995,"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/T12288","display_name":"Optimization and Search Problems","score":0.9936,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.993,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.7259587}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.7259587},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7207381},{"id":"https://openalex.org/C91280400","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Mobile ad hoc network","level":3,"score":0.595153},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.4675338},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.4653258},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43167192},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43068323},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.42166603},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3777274},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3294004},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.19853097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19623318},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.13662735},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06279674},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744313","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.59}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":18,"referenced_works":["https://openalex.org/W1598605300","https://openalex.org/W1647312842","https://openalex.org/W1659842140","https://openalex.org/W18216792","https://openalex.org/W1964005729","https://openalex.org/W1964241126","https://openalex.org/W1966939536","https://openalex.org/W2007035975","https://openalex.org/W2008434012","https://openalex.org/W2072583763","https://openalex.org/W2085054178","https://openalex.org/W2117473144","https://openalex.org/W2147585405","https://openalex.org/W2148653444","https://openalex.org/W2160958384","https://openalex.org/W2165558313","https://openalex.org/W2244557212","https://openalex.org/W26820422"],"related_works":["https://openalex.org/W2768875466","https://openalex.org/W2622357301","https://openalex.org/W2592414893","https://openalex.org/W2503658721","https://openalex.org/W2387743966","https://openalex.org/W2187251449","https://openalex.org/W2184514183","https://openalex.org/W2103865254","https://openalex.org/W2005598664","https://openalex.org/W161736287"],"abstract_inverted_index":{"Optimisation":[0],"under":[1,97,220],"dynamic":[2,39,65,70,115,253],"environment":[3,100,116],"is":[4,81,104,121,131,173,184,201],"a":[5,60,90,98,123,155,168,180],"well":[6],"known":[7],"challenge":[8],"not":[9],"only":[10],"because":[11,25],"of":[12,26,145,244],"the":[13,20,38,46,51,69,84,94,102,114,119,127,139,146,163,165,177,204,229,238,242],"difficulties":[14],"in":[15,76,237,250],"handling":[16,113],"constant":[17],"changes":[18,47],"during":[19],"search":[21,147,166,170,175,194],"progress":[22],"but":[23],"also":[24],"its":[27],"real-world":[28],"implication":[29],"as":[30],"many":[31],"industry":[32],"environments":[33],"are":[34,107,218],"dynamic.":[35,105],"To":[36],"tackle":[37],"aspect,":[40],"optimisation":[41,254],"algorithms":[42,108],"need":[43],"to":[44,82,174,185,192,202],"track":[45],"and":[48,143,196,223],"adjust":[49],"for":[50,64,68,110],"global":[52],"optima":[53],"simultaneously.":[54],"In":[55],"this":[56],"paper,":[57],"we":[58],"propose":[59],"multi-population":[61,128,181,247],"memetic":[62,129,248],"algorithm":[63,130,157,231],"optimisation,":[66],"specially":[67],"shortest":[71,85],"path":[72,87],"routing":[73],"(DSPR)":[74],"problem":[75],"mobile":[77],"ad-hoc":[78],"networks.":[79],"DSPR":[80,215],"find":[83],"possible":[86],"that":[88,217,228],"connects":[89],"source":[91],"node":[92,96],"with":[93,252],"destination":[95],"network":[99],"where":[101],"topology":[103],"There":[106],"proposed":[109,209,230,246],"DSPR.":[111],"However":[112],"while":[117],"maintaining":[118],"diversity":[120,187],"still":[122],"major":[124],"issue.":[125],"Hence":[126],"designed":[132],"which":[133,159,172,183,200],"has":[134,211],"four":[135],"main":[136],"parts":[137],"so":[138],"balance":[140],"between":[141],"exploration":[142],"exploitation":[144],"space":[148],"could":[149],"be":[150],"better":[151],"maintained.":[152],"They":[153],"include":[154],"genetic":[156],"part":[158],"focuses":[160],"solely":[161],"on":[162,214],"exploring":[164],"space;":[167],"local":[169,178],"component":[171],"around":[176],"area;":[179,195],"mechanism":[182],"maintain":[186],"by":[188],"allocating":[189],"every":[190],"sub-population":[191],"different":[193],"an":[197],"external":[198],"archive":[199],"preserve":[203],"current":[205],"best":[206],"solutions.":[207],"The":[208],"method":[210],"been":[212],"evaluated":[213],"instances":[216],"generated":[219],"both":[221],"cyclic":[222],"acyclic":[224],"environments.":[225],"Results":[226],"show":[227],"can":[232],"outperform":[233],"other":[234],"methods":[235],"reported":[236],"literature.":[239],"That":[240],"indicates":[241],"effectiveness":[243],"our":[245],"approach":[249],"dealing":[251],"problems.":[255]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2558735631","counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1}],"updated_date":"2024-12-09T01:08:34.334151","created_date":"2016-12-08"}