{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:05:39Z","timestamp":1743091539474,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819708369"},{"type":"electronic","value":"9789819708376"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0837-6_18","type":"book-chapter","created":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T06:02:43Z","timestamp":1708495363000},"page":"256-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Graph Sequence Reinforcement Learning for Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Yiyang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Lin","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,22]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Hartmanis, J.: Computers and intractability: a guide to the theory of np-completeness (michael r. garey and david s. johnson). Siam Rev. 24, 90 (1982)","DOI":"10.1137\/1024022"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0191-2615(90)90002-G","volume":"24","author":"F Robust","year":"1990","unstructured":"Robust, F., Daganzo, C.F., Souleyrette, R.R., II.: Implementing vehicle routing models. Transp. Res. Part B Methodol. 24, 263\u2013286 (1990)","journal-title":"Transp. Res. Part B Methodol."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Zunic, E., Besirevic, A., Skrobo, R., Hasic, H., Hodzic, K., Djedovic, A.: Design of optimization system for warehouse order picking in real environment. In: XXVI International Conference on Information, Communication and Automation Technologies (ICAT), pp. 1\u20136. IEEE (2017)","DOI":"10.1109\/ICAT.2017.8171630"},{"key":"18_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05035-5","volume-title":"Models for Practical Routing Problems in Logistics","author":"S Anbuudayasankar","year":"2016","unstructured":"Anbuudayasankar, S., Ganesh, K., Mohapatra, S.: Models for Practical Routing Problems in Logistics. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-05035-5"},{"key":"18_CR5","unstructured":"Goh, Y.L., Lee, W.S., Bresson, X., Laurent, T., Lim, N.: Combining reinforcement learning and optimal transport for the traveling salesman problem. arXiv preprint arXiv:2203.00903 (2022)"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"2733","DOI":"10.1007\/s10462-021-10061-9","volume":"55","author":"N Le","year":"2021","unstructured":"Le, N., Rathour, V.S., Yamazaki, K., Luu, K., Savvides, M.: Deep reinforcement learning in computer vision: a comprehensive survey. Artif. Intell. Rev. 55(4), 2733\u20132819 (2021). https:\/\/doi.org\/10.1007\/s10462-021-10061-9","journal-title":"Artif. Intell. Rev."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10958-023-06519-6","volume":"273","author":"EO Arkhangelskaya","year":"2023","unstructured":"Arkhangelskaya, E.O., Nikolenko, S.I.: Deep learning for natural language processing: a survey. J. Math. Sci. 273, 533\u2013582 (2023). https:\/\/doi.org\/10.1007\/s10958-023-06519-6","journal-title":"J. Math. Sci."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290, 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR9","unstructured":"Qiu, R., Sun, Z., Yang, Y.: DIMES: a differentiable meta solver for combinatorial optimization problems. In: Advances in Neural Information Processing Systems, vol. 35, pp. 25531\u201325546 (2022)"},{"key":"18_CR10","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)"},{"key":"18_CR11","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)"},{"key":"18_CR12","unstructured":"Joshi, C.K., Laurent, T., Bresson, X.: An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227 (2019)"},{"key":"18_CR13","unstructured":"Ma, Q., Ge, S., He, D., Thaker, D., Drori, I.: Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning. arXiv preprint arXiv:1911.04936 (2019)"},{"key":"18_CR14","unstructured":"Bresson, X., Laurent, T.: The transformer network for the traveling salesman problem. arXiv preprint arXiv:2103.03012 (2021)"},{"key":"18_CR15","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"key":"18_CR16","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"18_CR17","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 (2018)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-031-08011-1_14","volume-title":"CPAIOR 2022","author":"W Kool","year":"2022","unstructured":"Kool, W., van Hoof, H., Gromicho, J., Welling, M.: Deep policy dynamic programming for vehicle routing problems. In: Schaus, P. (ed.) CPAIOR 2022, vol. 13292, pp. 190\u2013213. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08011-1_14"},{"key":"18_CR19","unstructured":"Kielak, K.: Importance of using appropriate baselines for evaluation of data-efficiency in deep reinforcement learning for Atari. arXiv preprint arXiv:2003.10181 (2020)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Cook, W.J., Applegate, D.L., Bixby, R.E., Chvatal, V.: The Traveling Salesman Problem: A Computational Study. Princeton University Press (2011)","DOI":"10.1515\/9781400841103"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."}],"container-title":["Communications in Computer and Information Science","Data Mining and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0837-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T06:10:16Z","timestamp":1708495816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0837-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708369","9789819708376"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0837-6_18","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DMBD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Mining and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sanya","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dmbd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/dmbd2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"79","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}