{"id":"https://openalex.org/W4400063602","doi":"https://doi.org/10.1109/eais58494.2024.10569999","title":"Learning to Escape: Multi-mode Policy Learning for the Traveling Salesmen Problem","display_name":"Learning to Escape: Multi-mode Policy Learning for the Traveling Salesmen Problem","publication_year":2024,"publication_date":"2024-05-23","ids":{"openalex":"https://openalex.org/W4400063602","doi":"https://doi.org/10.1109/eais58494.2024.10569999"},"language":"en","primary_location":{"id":"doi:10.1109/eais58494.2024.10569999","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/eais58494.2024.10569999","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Evolving and Adaptive Intelligent Systems (EAIS)","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/A5032867812","display_name":"Myoung Hoon Ha","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Myoung Hoon Ha","raw_affiliation_strings":["KAIST,Center for Neuroscience-inspired AI,Daejeon,Korea","Center for Neuroscience-inspired AI, KAIST, Daejeon, Korea"],"affiliations":[{"raw_affiliation_string":"KAIST,Center for Neuroscience-inspired AI,Daejeon,Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Center for Neuroscience-inspired AI, KAIST, Daejeon, Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022708449","display_name":"Seunggeun Chi","orcid":"https://orcid.org/0000-0001-6965-6938"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seunggeun Chi","raw_affiliation_strings":["Purdue University,School of Electrical & Computer Engineering,West Lafayette,USA"],"affiliations":[{"raw_affiliation_string":"Purdue University,School of Electrical & Computer Engineering,West Lafayette,USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108148372","display_name":"Sang Wan Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]},{"id":"https://openalex.org/I4210104429","display_name":"Institute of Cognitive and Brain Sciences","ror":"https://ror.org/01c3w3270","country_code":"US","type":"education","lineage":["https://openalex.org/I4210104429"]}],"countries":["KR","US"],"is_corresponding":false,"raw_author_name":"Sang Wan Lee","raw_affiliation_strings":["KAIST,Department of Brain Cognitive Science,Daejeon,Korea","Department of Brain Cognitive Science, KAIST, Daejeon, Korea"],"affiliations":[{"raw_affiliation_string":"KAIST,Department of Brain Cognitive Science,Daejeon,Korea","institution_ids":["https://openalex.org/I4210104429"]},{"raw_affiliation_string":"Department of Brain Cognitive Science, KAIST, Daejeon, Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032867812"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.3506,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57761939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9932000041007996,"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":0.9932000041007996,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9861999750137329,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9793999791145325,"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/markov-decision-process","display_name":"Markov decision process","score":0.6629951000213623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6614277958869934},{"id":"https://openalex.org/keywords/mode","display_name":"Mode (computer interface)","score":0.6273585557937622},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6045767664909363},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5475592613220215},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5352450609207153},{"id":"https://openalex.org/keywords/q-learning","display_name":"Q-learning","score":0.5048440098762512},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.47183993458747864},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.46588462591171265},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4549001455307007},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.43874457478523254},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.42440617084503174},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.41099289059638977},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19929417967796326},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1576191782951355}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6629951000213623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6614277958869934},{"id":"https://openalex.org/C48677424","wikidata":"https://www.wikidata.org/wiki/Q6888088","display_name":"Mode (computer interface)","level":2,"score":0.6273585557937622},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6045767664909363},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5475592613220215},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5352450609207153},{"id":"https://openalex.org/C188116033","wikidata":"https://www.wikidata.org/wiki/Q2664563","display_name":"Q-learning","level":3,"score":0.5048440098762512},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.47183993458747864},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.46588462591171265},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4549001455307007},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.43874457478523254},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.42440617084503174},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.41099289059638977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19929417967796326},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1576191782951355},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/eais58494.2024.10569999","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/eais58494.2024.10569999","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Evolving and Adaptive Intelligent Systems (EAIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320316851","display_name":"KT","ror":"https://ror.org/043n4tt17"},{"id":"https://openalex.org/F4320322093","display_name":"Electronics and Telecommunications Research Institute","ror":"https://ror.org/03ysstz10"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W192091370","https://openalex.org/W626292722","https://openalex.org/W2003118470","https://openalex.org/W2011039300","https://openalex.org/W2017708378","https://openalex.org/W2031286643","https://openalex.org/W2032431794","https://openalex.org/W2042986967","https://openalex.org/W2072441740","https://openalex.org/W2125930537","https://openalex.org/W2133510907","https://openalex.org/W2305224893","https://openalex.org/W2307604735","https://openalex.org/W2618079578","https://openalex.org/W2784910652","https://openalex.org/W2805798351","https://openalex.org/W2899771611","https://openalex.org/W2909432082","https://openalex.org/W2913457594","https://openalex.org/W2919115771","https://openalex.org/W2952332632","https://openalex.org/W2959993166","https://openalex.org/W2964043796","https://openalex.org/W3047863327","https://openalex.org/W3129736740","https://openalex.org/W3130706049","https://openalex.org/W3146106549","https://openalex.org/W3174803387","https://openalex.org/W3188522200","https://openalex.org/W4212996499","https://openalex.org/W4224138275","https://openalex.org/W4288093623","https://openalex.org/W4298857966","https://openalex.org/W4317670814","https://openalex.org/W4385245566","https://openalex.org/W4394657357","https://openalex.org/W6610072603","https://openalex.org/W6619920785","https://openalex.org/W6637242042","https://openalex.org/W6637967152","https://openalex.org/W6638667902","https://openalex.org/W6678818196","https://openalex.org/W6692846177","https://openalex.org/W6725207838","https://openalex.org/W6730742100","https://openalex.org/W6734215269","https://openalex.org/W6736057607","https://openalex.org/W6736495275","https://openalex.org/W6747830441","https://openalex.org/W6756040250","https://openalex.org/W6758687306","https://openalex.org/W6767317771","https://openalex.org/W6849169497","https://openalex.org/W6864496293"],"related_works":["https://openalex.org/W2808418668","https://openalex.org/W2185228534","https://openalex.org/W2357975469","https://openalex.org/W2101748387","https://openalex.org/W2107631366","https://openalex.org/W3096874164","https://openalex.org/W4281812492","https://openalex.org/W3105579180","https://openalex.org/W2970347269","https://openalex.org/W2146763310"],"abstract_inverted_index":{"The":[0],"traveling":[1],"salesmen":[2],"problem":[3,63,120],"(TSP)-one":[4],"of":[5,52,121,158,166],"the":[6,47,53,62,71,87,109,119,156,159,172,177],"most":[7],"fundamental":[8],"NP-hard":[9],"problems":[10],"in":[11,44,76,86,185],"combinatorial":[12],"optimization-has":[13],"received":[14],"considerable":[15],"attention":[16],"owing":[17],"to":[18,22,35,60,91,123,130,164,179],"its":[19,42],"direct":[20],"applicability":[21],"real-world":[23],"routing.":[24],"Recent":[25],"studies":[26],"on":[27],"TSP":[28],"have":[29],"adopted":[30],"a":[31,37,67,101,112,126,135,181],"deep":[32,54],"policy":[33,55,106,142,175],"network":[34],"learn":[36],"stochastic":[38],"acceptance":[39],"rule.":[40],"Despite":[41],"success":[43],"some":[45],"cases,":[46],"structural":[48],"and":[49,143,149],"functional":[50],"complexity":[51],"networks":[56],"makes":[57],"it":[58],"hard":[59],"explore":[61],"space":[64],"while":[65],"performing":[66],"local":[68,88,127,147,183],"search":[69,128,148,184],"at":[70],"same":[72],"time.":[73],"We":[74,133],"found":[75],"our":[77],"empirical":[78],"analyses":[79],"that":[80,155,165,171],"searching":[81],"processes":[82],"are":[83],"often":[84],"stuck":[85],"region,":[89],"leading":[90],"severe":[92],"performance":[93,157],"degradation.":[94],"To":[95],"tackle":[96],"this":[97],"issue,":[98],"we":[99],"propose":[100],"novel":[102],"method":[103,161],"for":[104,146],"multi-mode":[105,136],"learning.":[107],"In":[108],"proposed":[110,160],"method,":[111],"conventional":[113],"exploration-exploitation":[114],"scheme":[115],"is":[116,162],"reformulated":[117],"as":[118],"learning":[122],"escape":[124],"from":[125],"area":[129],"induce":[131],"exploration.":[132],"present":[134],"Markov":[137],"decision":[138],"process,":[139],"followed":[140],"by":[141],"value":[144],"design":[145],"escaping":[150,174],"modes.":[151],"Experimental":[152],"results":[153],"show":[154],"superior":[163],"various":[167],"baseline":[168],"models,":[169],"suggesting":[170],"learned":[173],"allows":[176],"model":[178],"initiate":[180],"new":[182],"promising":[186],"regions":[187],"efficiently.":[188]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}