{"id":"https://openalex.org/W2135729907","doi":"https://doi.org/10.4304/jcp.8.4.968-974","title":"A Quality of Service Anycast Routing Algorithm Based on Improved Ant Colony Optimization","display_name":"A Quality of Service Anycast Routing Algorithm Based on Improved Ant Colony Optimization","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2135729907","doi":"https://doi.org/10.4304/jcp.8.4.968-974","mag":"2135729907"},"language":"en","primary_location":{"id":"doi:10.4304/jcp.8.4.968-974","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.8.4.968-974","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of 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/A5115589019","display_name":"Yongsheng Li","orcid":"https://orcid.org/0000-0003-1632-3739"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yongsheng Li","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5115589019"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6896,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.77844266,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"8","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958000183105469,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958000183105469,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9934999942779541,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.986299991607666,"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/anycast","display_name":"Anycast","score":0.7966020107269287},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7926478385925293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.71640944480896},{"id":"https://openalex.org/keywords/ant","display_name":"ANT","score":0.5508914589881897},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5310229063034058},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.4628218114376068},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.4545634388923645},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.44549041986465454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29795366525650024},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.12832123041152954}],"concepts":[{"id":"https://openalex.org/C122005561","wikidata":"https://www.wikidata.org/wiki/Q613897","display_name":"Anycast","level":3,"score":0.7966020107269287},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7926478385925293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.71640944480896},{"id":"https://openalex.org/C97467695","wikidata":"https://www.wikidata.org/wiki/Q295802","display_name":"ANT","level":2,"score":0.5508914589881897},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5310229063034058},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.4628218114376068},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.4545634388923645},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.44549041986465454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29795366525650024},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.12832123041152954}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jcp.8.4.968-974","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.8.4.968-974","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-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/W1492640216","https://openalex.org/W1529799932","https://openalex.org/W1770158449","https://openalex.org/W2060051100","https://openalex.org/W2107941094","https://openalex.org/W2126281772","https://openalex.org/W2131131750","https://openalex.org/W2152178406","https://openalex.org/W2154929945","https://openalex.org/W2158240286","https://openalex.org/W2164267739","https://openalex.org/W2167143870","https://openalex.org/W2186067616","https://openalex.org/W2354270910","https://openalex.org/W2355242498","https://openalex.org/W2356414575","https://openalex.org/W2358530608","https://openalex.org/W2368966692","https://openalex.org/W2393083281","https://openalex.org/W3126616698","https://openalex.org/W3139849174","https://openalex.org/W6675948105","https://openalex.org/W7007835035"],"related_works":["https://openalex.org/W4237535716","https://openalex.org/W2110363036","https://openalex.org/W2353347872","https://openalex.org/W2384909224","https://openalex.org/W2475669615","https://openalex.org/W2096952216","https://openalex.org/W2358213082","https://openalex.org/W1989577593","https://openalex.org/W1513827018","https://openalex.org/W2375249178"],"abstract_inverted_index":{"Quality":[0],"of":[1,64,150,159,211],"Service":[2],"(QoS)":[3],"anycast":[4,105],"routing":[5,106],"problem":[6,24],"is":[7,14,37,92,120,133,143,165,174,225],"a":[8,18,38],"nonlinear":[9],"combination":[10],"optimization":[11,34,79],"problem,":[12,20],"which":[13,60,126,176],"proved":[15],"to":[16,97,147,155,182,191,217],"be":[17,26],"NP-complete":[19],"at":[21],"present,":[22],"the":[23,44,52,57,62,82,89,111,123,129,137,148,156,160,162,179,192,199,218,223],"can":[25,127,177,188,207],"prevailingly":[27],"solved":[28],"by":[29],"heuristic":[30],"methods.":[31],"Ant":[32],"colony":[33,172],"algorithm":[35,180,200,224],"(ACO)":[36],"novel":[39],"random":[40],"search":[41,204],"algorithm.":[42],"On":[43],"one":[45],"hand,":[46,59],"it":[47],"does":[48],"not":[49],"depend":[50],"on":[51,56],"specific":[53],"mathematical":[54],"description,":[55],"other":[58],"has":[61,72,85,114,201],"advantages":[63],"robust,":[65],"positive":[66],"feedback,":[67],"distributed":[68],"computing.":[69],"Consequently,":[70],"ACO":[71,84,113],"been":[73,115],"widely":[74],"used":[75],"in":[76,99,122],"solving":[77,103],"combinatorial":[78],"problems.":[80],"However,":[81],"basic":[83,112],"several":[86],"shortcomings":[87],"that":[88,198],"convergence":[90,164],"rate":[91],"slow":[93],"and":[94,169,187,206,214,227],"it\u2019s":[95],"easily":[96],"stuck":[98],"local":[100,185,212],"optimum":[101,213],"for":[102],"QoS":[104],"problem.":[107],"In":[108],"this":[109],"paper,":[110],"improved,":[116],"firstly,":[117],"iteration":[118],"operator":[119],"introduced":[121],"node":[124,130],"selection,":[125],"make":[128,178],"selection":[131],"strategy":[132],"adjusted":[134,144],"dynamically":[135],"with":[136],"iteration.":[138],"Secondly,":[139],"pheromone":[140],"evaporation":[141],"coefficient":[142],"adaptively":[145],"according":[146,154],"distribution":[149],"ant":[151,171],"colony.":[152],"Finally,":[153],"evolutionary":[157],"speed":[158],"population,":[161],"premature":[163],"estimated.":[166],"The":[167],"mutation":[168],"secondary":[170],"operation":[173],"introduced,":[175],"successfully":[181],"escape":[183],"from":[184],"optima,":[186],"rapidly":[189,215],"approximate":[190],"global":[193,203,219],"optimum.":[194],"Simulation":[195],"results":[196],"show":[197],"preferable":[202],"ability":[205],"effectively":[208],"jump":[209],"out":[210],"converge":[216],"optimal":[220],"solution.":[221],"Thereby,":[222],"feasible":[226],"effective.":[228]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}