{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T08:31:37Z","timestamp":1773477097152,"version":"3.50.1"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"National Science and Technology Innovation 2030 Major Project of the Ministry of Science and Technology of China","award":["2018AAA0100700"],"award-info":[{"award-number":["2018AAA0100700"]}]},{"DOI":"10.13039\/501100004921","name":"Zhi-Yuan Chair Professorship Start-up Grant from Shanghai Jiao Tong University","doi-asserted-by":"publisher","award":["WF220103010"],"award-info":[{"award-number":["WF220103010"]}],"id":[{"id":"10.13039\/501100004921","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3000236","type":"journal-article","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T20:35:30Z","timestamp":1591389330000},"page":"108418-108428","source":"Crossref","is-referenced-by-count":52,"title":["A Graph Neural Network Assisted Monte Carlo Tree Search Approach to Traveling Salesman Problem"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1353-8507","authenticated-orcid":false,"given":"Zhihao","family":"Xing","sequence":"first","affiliation":[]},{"given":"Shikui","family":"Tu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","article-title":"Revised note on learning algorithms for quadratic assignment with graph neural networks","author":"nowak","year":"2017","journal-title":"arXiv 1706 07450"},{"key":"ref38","first-page":"45","article-title":"An analysis of several heuristics for the traveling salesman problem","author":"rosenkrantz","year":"2013","journal-title":"Proc Fundam Problems Comput Essays Honor Professor Daniel J Rosenkrantz"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF00337288"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(88)90002-0"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF00336888"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF00202610"},{"key":"ref37","first-page":"2702","article-title":"Discriminative embeddings of latent variable models for structured data","author":"dai","year":"2016","journal-title":"Proc 33nd Int Conf Mach Learn (ICML)"},{"key":"ref36","first-page":"5998","article-title":"Attention is all you need","author":"vaswani","year":"2017","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref35","first-page":"1928","article-title":"Asynchronous methods for deep reinforcement learning","author":"mnih","year":"2016","journal-title":"Proc 33nd Int Conf Mach Learn"},{"key":"ref34","first-page":"1","article-title":"Neural machine translation by jointly learning to align and translate","author":"bahdanau","year":"2015","journal-title":"Int Conf on Learning Representations"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1988.23942"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"Neural computation of decisions in optimization problems","volume":"52","author":"hopfield","year":"1985","journal-title":"Biol Cybern"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1988.23945"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90012-3"},{"key":"ref1","author":"applegate","year":"2006","journal-title":"The Traveling Salesman Problem A Computational Study"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2019.1911603"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1186\/s40535-018-0052-y"},{"key":"ref24","first-page":"494","article-title":"Algorithm cnneim—A and its mean complexity","author":"xu","year":"1987","journal-title":"Proc 2nd Int Conf Comput Appl"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36189-1_1"},{"key":"ref26","article-title":"A* tree search for portfolio management","author":"gao","year":"2019","journal-title":"arXiv 1901 01855"},{"key":"ref25","article-title":"Solve traveling salesman problem by Monte Carlo tree search and deep neural network","author":"xing","year":"2020","journal-title":"arXiv 2005 06879"},{"key":"ref50","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"defferrard","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref51","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-017-9337-x"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.023"},{"key":"ref10","first-page":"1","article-title":"Neural combinatorial optimization with reinforcement learning","author":"bello","year":"2017","journal-title":"Proc Int Conf Learn Represent (ICLR)ICLR"},{"key":"ref11","first-page":"1","article-title":"Attention, learn to solve routing problems!","author":"kool","year":"2019","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref40","first-page":"1024","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","author":"dai","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"ref14","first-page":"1","article-title":"Learning generalized reactive policies using deep neural networks","author":"groshev","year":"2018","journal-title":"Proc AAAI Spring Symp"},{"key":"ref15","first-page":"539","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","author":"li","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","first-page":"15554","article-title":"Exact combinatorial optimization with graph convolutional neural networks","author":"gasse","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1038\/nature16961","article-title":"Mastering the game of go with deep neural networks and tree search","volume":"529","author":"silver","year":"2016","journal-title":"Nature"},{"key":"ref19","first-page":"72","article-title":"Efficient selectivity and backup operators in monte-carlo tree search","author":"coulom","year":"2006","journal-title":"Proc Int Conf Comput Games"},{"key":"ref4","first-page":"513","article-title":"The christofides approximation algorithm","author":"goodrich","year":"2015","journal-title":"Algorithm design and applications"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1986.117"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0303-2647(97)01708-5"},{"key":"ref5","first-page":"215","article-title":"The traveling salesman problem: A case study in local optimization","volume":"1","author":"johnson","year":"1997","journal-title":"Local Search in Combinatorial Optimization"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1038\/nature14539","article-title":"Deep learning","volume":"521","author":"lecun","year":"2015","journal-title":"Nature"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.322"},{"key":"ref49","author":"sutton","year":"2018","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref9","first-page":"2692","article-title":"Pointer networks","author":"vinyals","year":"2015","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref46","author":"applegate","year":"2006","journal-title":"Concorde TSP Solver"},{"key":"ref45","first-page":"445","article-title":"Experimental analysis of heuristics for the ATSP","author":"johnson","year":"2001","journal-title":"Local Search Combin Optim"},{"key":"ref48","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref47","author":"optimization","year":"2013","journal-title":"Gurobi Optimizer 5 0"},{"key":"ref42","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume":"70","author":"gilmer","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9258-6"},{"key":"ref44","first-page":"1","article-title":"How powerful are graph neural networks?","author":"xu","year":"2019","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.145301"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09109309.pdf?arnumber=9109309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T21:32:24Z","timestamp":1666819944000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9109309\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":53,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3000236","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}