{"id":"https://openalex.org/W4210596901","doi":"https://doi.org/10.1109/apccas51387.2021.9687781","title":"Theoretical and Experimental Analysis of Traveling Salesman Walk Problem","display_name":"Theoretical and Experimental Analysis of Traveling Salesman Walk Problem","publication_year":2021,"publication_date":"2021-11-22","ids":{"openalex":"https://openalex.org/W4210596901","doi":"https://doi.org/10.1109/apccas51387.2021.9687781"},"language":"en","primary_location":{"id":"doi:10.1109/apccas51387.2021.9687781","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apccas51387.2021.9687781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Asia Pacific Conference on Circuit and Systems (APCCAS)","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/A5102310575","display_name":"Yasuhiro Takashima","orcid":null},"institutions":[{"id":"https://openalex.org/I17056963","display_name":"The University of Kitakyushu","ror":"https://ror.org/03mfefw72","country_code":"JP","type":"education","lineage":["https://openalex.org/I17056963"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yasuhiro Takashima","raw_affiliation_strings":["University of Kitakyushu,Kitakyushu,Japan","University of Kitakyushu, Kitakyushu, Japan"],"affiliations":[{"raw_affiliation_string":"University of Kitakyushu,Kitakyushu,Japan","institution_ids":["https://openalex.org/I17056963"]},{"raw_affiliation_string":"University of Kitakyushu, Kitakyushu, Japan","institution_ids":["https://openalex.org/I17056963"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101880152","display_name":"Yuichi Nakamura","orcid":"https://orcid.org/0000-0001-5103-7194"},"institutions":[{"id":"https://openalex.org/I118347220","display_name":"NEC (Japan)","ror":"https://ror.org/04jndar25","country_code":"JP","type":"company","lineage":["https://openalex.org/I118347220"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuichi Nakamura","raw_affiliation_strings":["NEC Corp.,Kawasaki,Japan","NEC Corp., Kawasaki, Japan"],"affiliations":[{"raw_affiliation_string":"NEC Corp.,Kawasaki,Japan","institution_ids":["https://openalex.org/I118347220"]},{"raw_affiliation_string":"NEC Corp., Kawasaki, Japan","institution_ids":["https://openalex.org/I118347220"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102310575"],"corresponding_institution_ids":["https://openalex.org/I17056963"],"apc_list":null,"apc_paid":null,"fwci":1.0378,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.81422619,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"241","last_page":"244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9927999973297119,"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.9927999973297119,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9873999953269958,"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"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9860000014305115,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8865525722503662},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5660056471824646},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4778282642364502},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4349175691604614},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.42453616857528687},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4095754623413086},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25182104110717773},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21928361058235168}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8865525722503662},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5660056471824646},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4778282642364502},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4349175691604614},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.42453616857528687},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4095754623413086},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25182104110717773},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21928361058235168}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/apccas51387.2021.9687781","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apccas51387.2021.9687781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Asia Pacific Conference on Circuit and Systems (APCCAS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4699999988079071,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W187767610","https://openalex.org/W1976231547","https://openalex.org/W2049287714","https://openalex.org/W2052091359","https://openalex.org/W2167920923","https://openalex.org/W2399100674","https://openalex.org/W4251394903","https://openalex.org/W6607571859"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2362402143","https://openalex.org/W2265604726","https://openalex.org/W2033053473","https://openalex.org/W2495211334"],"abstract_inverted_index":{"In":[0],"this":[1,34],"paper,":[2],"we":[3,41,56],"formulate":[4,57],"Traveling":[5,14,93],"Salesmen":[6],"Walk":[7],"(TSW)":[8],"problem":[9,35,44,48],"as":[10,59,86],"integer":[11,60],"linear":[12,61],"programming.":[13],"Salesman":[15,94],"Problem":[16,95],"is":[17,29,71,102],"one":[18,27],"of":[19,69,76,83,89,92,108],"the":[20,37,43,46,51,66,87,90,106,113],"most":[21],"popular":[22],"combinatorial":[23],"optimization":[24,114],"problems.":[25],"However,":[26],"constraint":[28],"too":[30],"strict":[31],"to":[32],"use":[33],"for":[36],"practical":[38],"situation.":[39],"Thus,":[40],"transform":[42],"into":[45],"TSW":[47,70],"by":[49],"relaxing":[50],"constraint.":[52],"To":[53],"solve":[54],"TSW,":[55],"it":[58],"programming":[62],"(ILP).":[63],"We":[64,79,97],"confirm":[65,99],"resultant":[67],"tour":[68],"12%":[72],"shorter":[73],"than":[74],"that":[75,100],"TSP,":[77],"empirically.":[78,116],"also":[80,98],"propose":[81],"Unsatisfaction":[82],"Triangle":[84],"Inequality":[85],"measurement":[88],"hardness":[91],"variants.":[96],"there":[101],"a":[103],"correlation":[104],"between":[105],"ratio":[107],"unsatisfying":[109],"triangle":[110],"inequality":[111],"and":[112],"run-time,":[115]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}