{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T14:45:02Z","timestamp":1750689902395,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819981250"},{"type":"electronic","value":"9789819981267"}],"license":[{"start":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:00:00Z","timestamp":1699833600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:00:00Z","timestamp":1699833600000},"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-99-8126-7_35","type":"book-chapter","created":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T08:01:53Z","timestamp":1700812913000},"page":"446-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Pointer Network and\u00a0Reinforcement Learning for\u00a0Thinnest Path Problem"],"prefix":"10.1007","author":[{"given":"Jingjing","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6125-183X","authenticated-orcid":false,"given":"Yang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chuang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,13]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Gao, J., Zhao, Q., Swami, A.: The thinnest path problem for secure communications. A directed hypergraph approach. In: Allerton Conference on Communication, Control, and Computing, pp. 847\u2013852 (2012)","DOI":"10.1109\/Allerton.2012.6483306"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Moberly, R.: A thinner thinnest path using directional transmissions in a network. In: Military Communications Conference, pp. 1026\u20131031 (2013)","DOI":"10.1109\/MILCOM.2013.178"},{"issue":"4","key":"35_CR3","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1109\/TNET.2014.2321159","volume":"23","author":"J Gao","year":"2015","unstructured":"Gao, J., Zhao, Q., Swami, A.: The thinnest path problem. IEEE-ACM Trans. Networking 23(4), 1176\u20131189 (2015)","journal-title":"IEEE-ACM Trans. Networking"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Wu, S., Chen, Z., Wang, Y., Gao, X., Wu, F., Chen, G.: Efficient approximations for thinnest path problem in grid graph. In: Ubiquitous Information Management and Communication, pp. 1\u20138 (2018)","DOI":"10.1145\/3164541.3164567"},{"key":"35_CR5","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems (2015)"},{"key":"35_CR6","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: International Conference on Learning Representations, pp. 1\u20138 (2017)"},{"key":"35_CR7","unstructured":"Nazari, M., Oroojlooy, A., Snyder, L., Tak\u00e1c, M.: Reinforcement learning for solving the vehicle routing problem. In: Advances in Neural Information Processing Systems (2018)"},{"key":"35_CR8","unstructured":"Dai, H., Khalil, E., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems, pp. 6348\u20136358 (2017)"},{"key":"35_CR9","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":"35_CR10","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-030-16194-1_9","volume-title":"Nonlinear Combinatorial Optimization","author":"T Guo","year":"2019","unstructured":"Guo, T., Han, C., Tang, S., Ding, M.: Solving combinatorial problems with machine learning methods. In: Du, D.-Z., Pardalos, P.M., Zhang, Z. (eds.) Nonlinear Combinatorial Optimization. SOIA, vol. 147, pp. 207\u2013229. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16194-1_9"},{"key":"35_CR11","unstructured":"Kool, W., Hoof, H., Welling, M.: Attention, learn to solve routing problems!. In: International Conference on Learning Representations (2019)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Barrett, T., Clements, W., Foerster, J., Lvovsky, A.: Exploratory combinatorial optimization with reinforcement learning. In: AAAI Conference on Artificial Intelligence, vol. 34, pp. 3243\u20133250 (2020)","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"35_CR13","unstructured":"Joshi, C., Laurent, T., Bresson, X.: An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227 (2019)"},{"key":"35_CR14","unstructured":"Li, Z., Chen, Q., Koltun, V.: Combinatorial optimization with graph convolutional networks and guided tree search. In: Advances in Neural Information Processing Systems, pp. 539\u2013548 (2018)"},{"issue":"2","key":"35_CR15","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(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"35_CR16","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1038\/s42256-022-00468-6","volume":"4","author":"M Schuetz","year":"2022","unstructured":"Schuetz, M., Brubaker, J., Katzgraber, H.: Combinatorial optimization with physics-inspired graph neural networks. Nat. Mach. Intell. 4(4), 367\u2013377 (2022)","journal-title":"Nat. Mach. Intell."},{"key":"35_CR17","doi-asserted-by":"publisher","unstructured":"Ma, H., Tu, S., Xu, L.: IA-CL: a deep bidirectional competitive learning method for traveling salesman problem. In: Tanveer, M., Agarwal, S., Ozawa, S., Ekbal, A., Jatowt, A. (eds.) Neural Information Processing, ICONIP 2022. LNCS, vol. 13623, pp. 525\u2013536. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-30105-6_44","DOI":"10.1007\/978-3-031-30105-6_44"},{"issue":"3\u20134","key":"35_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8(3\u20134), 229\u2013256 (1992)","journal-title":"Mach. Learn."},{"issue":"8","key":"35_CR19","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997)","journal-title":"Neural Comput."},{"key":"35_CR20","unstructured":"Gurobi Optimization, LLC: Gurobi optimizer reference manual (2022). Retrieved from http:\/\/www.gurobi.com"},{"key":"35_CR21","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms. In: Thesis Politecnico Di Milano Italy (1992)"}],"container-title":["Communications in Computer and Information Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8126-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:36:52Z","timestamp":1709811412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8126-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,13]]},"ISBN":["9789819981250","9789819981267"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8126-7_35","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023,11,13]]},"assertion":[{"value":"13 November 2023","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":"Changsha","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":"20 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2023.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":"1274","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":"650","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":"0","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":"51% - 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":"4.14","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":"2.46","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)"}}]}}