{"id":"https://openalex.org/W2078856178","doi":"https://doi.org/10.1007/s10878-008-9156-y","title":"The canadian traveller problem and its competitive analysis","display_name":"The canadian traveller problem and its competitive analysis","publication_year":2008,"publication_date":"2008-04-08","ids":{"openalex":"https://openalex.org/W2078856178","doi":"https://doi.org/10.1007/s10878-008-9156-y","mag":"2078856178"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-008-9156-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-008-9156-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-008-9156-y.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-008-9156-y.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113747124","display_name":"Yinfeng Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yinfeng Xu","raw_affiliation_strings":["School of Management, Xi\u2019an Jiaotong University, Xi\u2019an, 710049, China","The State Key Lab for Manufacturing Systems Engineering, Xi\u2019an, 710049, China","Xi\u2019an Jiaotong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Management, Xi\u2019an Jiaotong University, Xi\u2019an, 710049, China","institution_ids":["https://openalex.org/I87445476"]},{"raw_affiliation_string":"The State Key Lab for Manufacturing Systems Engineering, Xi\u2019an, 710049, China","institution_ids":[]},{"raw_affiliation_string":"Xi\u2019an Jiaotong University","institution_ids":["https://openalex.org/I87445476"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056650092","display_name":"Mao\u2010Lin Hu","orcid":"https://orcid.org/0000-0003-4130-9859"},"institutions":[{"id":"https://openalex.org/I4210131492","display_name":"Ningxia Normal University","ror":"https://ror.org/03saxfv98","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210131492"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Maolin Hu","raw_affiliation_strings":["Department of Mathematics, Guyuan Teachers College, Guyuan, 756000, China","Guyuan Teachers College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Guyuan Teachers College, Guyuan, 756000, China","institution_ids":["https://openalex.org/I4210131492"]},{"raw_affiliation_string":"Guyuan Teachers College","institution_ids":["https://openalex.org/I4210131492"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027552992","display_name":"Bing Su","orcid":"https://orcid.org/0000-0001-8560-1910"},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bing Su","raw_affiliation_strings":["School of Management, Xi\u2019an Jiaotong University, Xi\u2019an, 710049, China","The State Key Lab for Manufacturing Systems Engineering, Xi\u2019an, 710049, China","Xi\u2019an Jiaotong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Management, Xi\u2019an Jiaotong University, Xi\u2019an, 710049, China","institution_ids":["https://openalex.org/I87445476"]},{"raw_affiliation_string":"The State Key Lab for Manufacturing Systems Engineering, Xi\u2019an, 710049, China","institution_ids":[]},{"raw_affiliation_string":"Xi\u2019an Jiaotong University","institution_ids":["https://openalex.org/I87445476"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070925973","display_name":"Binhai Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I23732399","display_name":"Montana State University","ror":"https://ror.org/02w0trx84","country_code":"US","type":"education","lineage":["https://openalex.org/I23732399","https://openalex.org/I4210126032"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Binhai Zhu","raw_affiliation_strings":["Department of Computer Science, Montana State University, Bozeman, MT, 59717, USA","Montana State Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Montana State University, Bozeman, MT, 59717, USA","institution_ids":["https://openalex.org/I23732399"]},{"raw_affiliation_string":"Montana State Univ","institution_ids":["https://openalex.org/I23732399"]}]},{"author_position":"last","author":{"id":null,"display_name":"Zhijun Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhijun Zhu","raw_affiliation_strings":["School of Management, Xi\u2019an Jiaotong University, Xi\u2019an, 710049, China","Xi'an Jiaotong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Management, Xi\u2019an Jiaotong University, Xi\u2019an, 710049, China","institution_ids":["https://openalex.org/I87445476"]},{"raw_affiliation_string":"Xi'an Jiaotong University","institution_ids":["https://openalex.org/I87445476"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5113747124"],"corresponding_institution_ids":["https://openalex.org/I87445476"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.7624,"has_fulltext":true,"cited_by_count":47,"citation_normalized_percentile":{"value":0.76520762,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"18","issue":"2","first_page":"195","last_page":"205"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6223374009132385},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5975443720817566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5948822498321533},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5863819718360901},{"id":"https://openalex.org/keywords/adaptive-strategies","display_name":"Adaptive strategies","score":0.5346181988716125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5166295170783997},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5127404928207397},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48118287324905396},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4529976546764374},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.45086368918418884},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4343174397945404},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3764178156852722},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33648839592933655},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31958138942718506},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23912909626960754},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.22468462586402893},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1385059356689453},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.08927810192108154}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6223374009132385},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5975443720817566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5948822498321533},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5863819718360901},{"id":"https://openalex.org/C167393769","wikidata":"https://www.wikidata.org/wiki/Q4680768","display_name":"Adaptive strategies","level":2,"score":0.5346181988716125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5166295170783997},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5127404928207397},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48118287324905396},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4529976546764374},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.45086368918418884},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4343174397945404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3764178156852722},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33648839592933655},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31958138942718506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23912909626960754},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.22468462586402893},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1385059356689453},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.08927810192108154},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-008-9156-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-008-9156-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-008-9156-y.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:18:y:2009:i:2:d:10.1007_s10878-008-9156-y","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-008-9156-y","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10878-008-9156-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-008-9156-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-008-9156-y.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2078856178.pdf","grobid_xml":"https://content.openalex.org/works/W2078856178.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W52281146","https://openalex.org/W98708187","https://openalex.org/W1512794094","https://openalex.org/W1552828154","https://openalex.org/W1992876208","https://openalex.org/W2008896030","https://openalex.org/W2015061583","https://openalex.org/W2041645394","https://openalex.org/W2092129437","https://openalex.org/W2157650361","https://openalex.org/W2169401877","https://openalex.org/W2358051791","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W4297052981"],"abstract_inverted_index":{"From":[0],"the":[1,8,15,20,23,26,37,48,56,60,64,75,80,94,116,120,125,129,151,157,163,172,176,195,198],"online":[2],"point":[3],"of":[4,22,28,47,82,87,144,159,170,197],"view,":[5],"we":[6,102,166],"study":[7],"Canadian":[9],"Traveller":[10],"Problem":[11],"(CTP),":[12],"in":[13,18,97,123,162,184,201],"which":[14,78,124],"traveller":[16,38,126],"knows":[17,93],"advance":[19],"structure":[21],"graph":[24],"and":[25,36,111,119,147,175],"costs":[27],"all":[29],"edges.":[30],"However,":[31],"some":[32],"edges":[33,161],"may":[34],"fail":[35],"only":[39],"observes":[40],"that":[41,86,92],"upon":[42],"reaching":[43],"an":[44,71,168,185,191],"adjacent":[45],"vertex":[46],"blocked":[49],"edge.":[50,138],"The":[51],"goal":[52],"is":[53,156],"to":[54,63,69,128,194],"find":[55,70],"least-cost":[57],"route":[58],"from":[59],"source":[61,130],"O":[62],"destination":[65],"D,":[66],"more":[67],"precisely,":[68],"adaptive":[72,105],"strategy":[73,84,110,114,118,122,174,178],"minimizing":[74],"competitive":[76,142],"ratio,":[77],"compares":[79],"performance":[81],"this":[83,100],"with":[85],"a":[88,112,136,202],"hypothetical":[89],"offline":[90],"algorithm":[91],"entire":[95],"topology":[96],"advance.":[98],"In":[99],"paper,":[101],"present":[103],"two":[104,152],"strategies\u2014a":[106],"greedy":[107,117,173],"or":[108],"myopic":[109],"comparison":[113,177],"combining":[115],"reposition":[121],"backtracks":[127],"every":[131],"time":[132],"when":[133],"he/she":[134],"sees":[135],"failed":[137,160],"We":[139],"prove":[140],"tight":[141],"ratios":[143],"2":[145],"k+1\u22121":[146],"2k+1":[148],"respectively":[149],"for":[150],"strategies,":[153],"where":[154],"k":[155],"number":[158],"graph.":[164,204],"Finally,":[165],"propose":[167],"explanation":[169],"why":[171],"are":[179],"usually":[180],"preferred":[181],"by":[182],"drivers":[183],"urban":[186],"traffic":[187],"environment,":[188],"based":[189],"on":[190],"argument":[192],"related":[193],"length":[196],"second-shortest":[199],"path":[200],"grid":[203]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2025-10-10T00:00:00"}