{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:43:15Z","timestamp":1742938995401,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030922375"},{"type":"electronic","value":"9783030922382"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92238-2_18","type":"book-chapter","created":{"date-parts":[[2021,12,4]],"date-time":"2021-12-04T22:02:35Z","timestamp":1638655355000},"page":"213-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dy-Drl2Op: Learning Heuristics for TSP on the Dynamic Graph via Deep Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Haojie","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jiangting","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xingfeng","family":"Lv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,5]]},"reference":[{"key":"18_CR1","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, Learn to Solve Routing Problems! (2018)"},{"key":"18_CR2","unstructured":"Salakhutdinov, R., Hinton, G.E.: Replicated softmax: an undirected topic model. In: Advances in Neural Information Processing Systems 22: Conference on Neural Information Processing Systems (2009)"},{"issue":"7","key":"18_CR3","first-page":"665","volume":"15","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement learning. Bradford Book 15(7), 665\u2013685 (1998)","journal-title":"Bradford Book"},{"key":"18_CR4","unstructured":"White, C.C., et al.: Markov decision processe. Eur. J. Oper. Res. (1989)"},{"key":"18_CR5","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, pp. 6000\u20136010 (2017)"},{"issue":"2","key":"18_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/261342.571216","volume":"28","author":"DS Hochba","year":"1997","unstructured":"Hochba, D.S.: Approximation algorithms for NP-hard problems. ACM SIGACT News 28(2), 40\u201352 (1997)","journal-title":"ACM SIGACT News"},{"issue":"3","key":"18_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1207\/s15516709cog1603_1","volume":"16","author":"MI Jordan","year":"2010","unstructured":"Jordan, M.I., Rumelhart, D.E.: Forward models: supervised learning with a distal teacher. Cogn. Sci. 16(3), 307\u2013354 (2010)","journal-title":"Cogn. Sci."},{"key":"18_CR8","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: International Conference on Learning Representations (ICLR) (2017)"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.1996.tb00032.x","volume":"3","author":"A Colorni","year":"2010","unstructured":"Colorni, A., Dorigo, M., Maffioli, F., et al.: Heuristics from nature for hard combinatorial optimization problems. Int. Trans. Oper. Res. 3(1), 1\u201321 (2010)","journal-title":"Int. Trans. Oper. Res."},{"key":"18_CR10","unstructured":"Khalil, E., Dai, H., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems, pp. 6351\u20136361 (2017)"},{"key":"18_CR11","unstructured":"Liang, E., Liaw, R., Moritz, P., et al.: RLlib: abstractions for distributed reinforcement learning (2017)"},{"key":"18_CR12","unstructured":"Joshi, C.K., Laurent, T., Bresson, X.: An efficient graph convolutional network technique for the travelling salesman problem (2019)"},{"issue":"3\u20134","key":"18_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"C Watkins","year":"1992","unstructured":"Watkins, C., Dayan, P.: Technical note: q-learning. Mach. Learn. 8(3\u20134), 279\u2013292 (1992)","journal-title":"Mach. Learn."},{"key":"18_CR14","unstructured":"Kulkarni, T.D., Narasimhan, K.R., Saeedi, A., et al.: Hierarchical deep reinforcement learning: integrating temporal abstraction and intrinsic motivation (2016)"},{"key":"18_CR15","unstructured":"Zaremba, W., Sutskever, I., Vinyals, O.: Recurrent Neural Network Regularization (2014). Eprint"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Edwards, M., Xie, X.: Graph convolutional neural network. In: British Machine Vision Conference (2016)","DOI":"10.5244\/C.30.114"},{"key":"18_CR17","unstructured":"Sutskever, I., Vinyals, O., Le, Q.V.: Sequence to sequence learning with neural networks. In: Advances in Neural Information Processing Systems (2014)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Garg, S., Peitz, S., Nallasamy, U., et al.: Jointly learning to align and translate with transformer models (2019)","DOI":"10.18653\/v1\/D19-1453"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Wiseman, S., Rush, A.M.: Sequence-to-sequence learning as beam-search optimization. In: Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (2016)","DOI":"10.18653\/v1\/D16-1137"},{"key":"18_CR20","unstructured":"Nazari, M.R., Oroojlooy, A., Snyder, L., Takac, M.: Reinforcement learning for solving the vehicle routing problem. In: Advances in Neural Information Processing Systems, pp. 9860\u20139870 (2018)"},{"key":"18_CR21","unstructured":"Kingma, D., Ba, J.: Adam: a method for stochastic optimization. Comput. Sci. (2014)"},{"key":"18_CR22","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems, pp. 2692\u20132700 (2015)"},{"key":"18_CR23","unstructured":"Osband, I., Blundell, C., Pritzel, A., et al.: Deep exploration via bootstrapped DQN (2016)"},{"key":"18_CR24","unstructured":"Nassar, K.: Transformer-based language modeling and decoding for conversational speech recognition (2020)"},{"issue":"4","key":"18_CR25","first-page":"3243","volume":"34","author":"T Barrett","year":"2020","unstructured":"Barrett, T., Clements, W., Foerster, J., et al.: Exploratory combinatorial optimization with reinforcement learning. Proc. AAAI Conf. Artif. Intell. 34(4), 3243\u20133250 (2020)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"18_CR26","first-page":"249","volume":"9","author":"X Glorot","year":"2010","unstructured":"Glorot, X., Bengio, Y.: Understanding the difficulty of training deep feedforward neural networks. J. Mach. Learn. Res. 9, 249\u2013256 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"18_CR27","unstructured":"Helsgaun, K.: An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems. Technical report (2017)"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92238-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:51:49Z","timestamp":1710355909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92238-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030922375","9783030922382"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92238-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sanur, Bali","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iconip2021.apnns.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"1093","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":"226","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":"177","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":"21% - 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.57","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":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","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)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}