{"id":"https://openalex.org/W4381736808","doi":"https://doi.org/10.1142/s0218126624500336","title":"An Adaptive Cuckoo Algorithm-Based Optimization Method for Tourist Traffic Routes","display_name":"An Adaptive Cuckoo Algorithm-Based Optimization Method for Tourist Traffic Routes","publication_year":2023,"publication_date":"2023-06-23","ids":{"openalex":"https://openalex.org/W4381736808","doi":"https://doi.org/10.1142/s0218126624500336"},"language":"en","primary_location":{"id":"doi:10.1142/s0218126624500336","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0218126624500336","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/A5061160183","display_name":"Qian Hong","orcid":"https://orcid.org/0000-0002-0293-1699"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Qian Hong","raw_affiliation_strings":["School of Innovation & Entreprenurship, Chongqing Institute of Engineering, Chongqing 400056, P. R. China"],"affiliations":[{"raw_affiliation_string":"School of Innovation & Entreprenurship, Chongqing Institute of Engineering, Chongqing 400056, P. R. China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102511484","display_name":"Yanbin Sun","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yanbin Sun","raw_affiliation_strings":["School of Electronic Information, Chongqing Institute of Engineering, Chongqing 400056, P. R. China"],"affiliations":[{"raw_affiliation_string":"School of Electronic Information, Chongqing Institute of Engineering, Chongqing 400056, P. R. China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061160183"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05580451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"02","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13918","display_name":"Advanced Data and IoT Technologies","score":0.9993000030517578,"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/T13918","display_name":"Advanced Data and IoT Technologies","score":0.9993000030517578,"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/T11478","display_name":"Caching and Content Delivery","score":0.991100013256073,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/algorithm","display_name":"Algorithm","score":0.5943450331687927},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5819171071052551},{"id":"https://openalex.org/keywords/cuckoo-search","display_name":"Cuckoo search","score":0.5669394135475159},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5555668473243713},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5314691662788391},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4584408104419708},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2620192766189575},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.11027619242668152}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5943450331687927},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5819171071052551},{"id":"https://openalex.org/C117241572","wikidata":"https://www.wikidata.org/wiki/Q5192379","display_name":"Cuckoo search","level":3,"score":0.5669394135475159},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5555668473243713},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5314691662788391},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4584408104419708},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2620192766189575},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.11027619242668152},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218126624500336","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0218126624500336","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W2753354457","https://openalex.org/W2801719811","https://openalex.org/W2893346468","https://openalex.org/W2995606192","https://openalex.org/W3017937359","https://openalex.org/W3034948756","https://openalex.org/W3044367651","https://openalex.org/W3088927520","https://openalex.org/W3095147220","https://openalex.org/W3131410378","https://openalex.org/W3159162481","https://openalex.org/W3208509675","https://openalex.org/W4226226550","https://openalex.org/W4285142610","https://openalex.org/W4285240194","https://openalex.org/W4285297940","https://openalex.org/W4292261130","https://openalex.org/W4293731203","https://openalex.org/W4293731782","https://openalex.org/W4296849331","https://openalex.org/W4312959111","https://openalex.org/W4321792464"],"related_works":["https://openalex.org/W1978568284","https://openalex.org/W2742451303","https://openalex.org/W2102833174","https://openalex.org/W2753354457","https://openalex.org/W2329556607","https://openalex.org/W3013665388","https://openalex.org/W2574858863","https://openalex.org/W2895514756","https://openalex.org/W2997067626","https://openalex.org/W2045438354"],"abstract_inverted_index":{"This":[0,37,260],"paper":[1,38,261],"presents":[2],"in-depth":[3],"research":[4],"and":[5,31,60,84,91,157,169,198,210,279,306,313],"analysis":[6],"of":[7,11,27,73,81,87,113,134,190,201,215,257,265,275,308],"the":[8,16,25,40,50,79,88,94,98,103,106,111,114,123,127,132,135,141,153,160,185,194,211,226,243,248,263,273,288,292,304,309],"optimization":[9,182,322],"method":[10],"tourist":[12,244],"traffic":[13,245],"routes":[14],"using":[15,225],"adaptive":[17,42,56,235],"cuckoo":[18,22,298],"algorithm.":[19,136],"The":[20,233],"traditional":[21],"algorithm":[23,44,90,146,162,237,299,310],"has":[24,163],"disadvantages":[26],"slow":[28],"convergence":[29,95,112],"speed":[30,92,96],"easy":[32],"falling":[33],"into":[34,271,300],"local":[35,82,175],"extremes.":[36],"proposes":[39],"iterative":[41,142,234],"CHSACS":[43,145,161,236],"based":[45,206,229],"on":[46,49,140,207,230],"iteration.":[47],"Based":[48],"original":[51,154],"CS":[52,75,89,155],"algorithm,":[53,115,156,159],"a":[54,61,71,116,170,282,315],"dynamic":[55,186],"step":[57],"control":[58],"amount":[59],"segmented":[62],"weighted":[63],"position":[64],"update":[65],"formula":[66],"are":[67,138,204],"introduced":[68,120],"to":[69,77,121,130,173,240],"give":[70],"class":[72],"improved":[74],"algorithms":[76],"coordinate":[78],"problem":[80,104,189],"search":[83,86,128,167,227],"global":[85],"up":[93],"at":[97],"later":[99],"stage.":[100],"To":[101],"address":[102],"that":[105],"out-of-bounds":[107,124],"nests":[108,125],"interfere":[109],"with":[110,147,152,179,247,287],"memory":[117],"strategy":[118],"is":[119,221,238],"relocate":[122],"in":[126],"space":[129],"improve":[131],"stability":[133],"Experiments":[137],"conducted":[139],"adaptive-based":[143],"conductive":[144],"test":[148],"function":[149,181],"sets.":[150],"Compared":[151],"ACO":[158],"faster":[164],"convergence,":[165],"higher":[166],"accuracy":[168],"better":[171],"ability":[172],"avoid":[174],"optima":[176],"when":[177],"dealing":[178],"continuous":[180],"problems.":[183,323],"For":[184],"travel":[187,191,196,216,250,252],"path":[188,253],"time":[192,197,200,217,231,251],"optimization,":[193],"road":[195],"sightseeing":[199],"different":[202],"periods":[203],"predicted":[205],"historical":[208],"data,":[209],"most":[212],"traveled":[213],"distance":[214],"between":[218],"two":[219],"sights":[220],"dynamically":[222],"searched":[223],"by":[224],"mechanism":[228],"windows.":[232],"used":[239],"continuously":[241],"find":[242],"route":[246],"shortest":[249],"from":[254],"all":[255],"combinations":[256],"tour":[258],"sequences.":[259],"combines":[262],"characteristics":[264],"bus":[266,277,283,301,320],"vehicle":[267,284],"scheduling":[268,285,321],"itself,":[269],"takes":[270],"account":[272],"interests":[274],"both":[276],"companies":[278],"tourists,":[280],"establishes":[281],"model":[286],"departure":[289],"interval":[290],"as":[291],"independent":[293],"variable,":[294],"introduces":[295],"this":[296],"hybrid":[297],"scheduling,":[302],"verifies":[303],"scientific":[305],"feasibility":[307],"through":[311],"examples,":[312],"provides":[314],"new":[316],"idea":[317],"for":[318],"solving":[319]},"counts_by_year":[],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}