{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:50:29Z","timestamp":1762509029266,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442155"},{"type":"electronic","value":"9783031442162"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-44216-2_31","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T07:02:58Z","timestamp":1695279778000},"page":"377-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["GatedGCN with\u00a0GraphSage to\u00a0Solve Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Hua","family":"Yang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S.: The approximability of np-hard problems. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 337\u2013348 (1998)","DOI":"10.1145\/276698.276784"},{"key":"31_CR2","unstructured":"Bahdanau, D., Cho, K., Bengio, Y.: Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473 (2014)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Barrett, T., Clements, W., Foerster, J., Lvovsky, A.: Exploratory combinatorial optimization with reinforcement learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 3243\u20133250 (2020)","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"31_CR4","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":"31_CR5","unstructured":"Boese, K.D.: Cost versus distance in the traveling salesman problem. Citeseer (1995)"},{"key":"31_CR6","unstructured":"Bresson, X., Laurent, T.: Residual gated graph convnets. arXiv preprint arXiv:1711.07553 (2017)"},{"key":"31_CR7","unstructured":"Bresson, X., Laurent, T.: The transformer network for the traveling salesman problem. arXiv preprint arXiv:2103.03012 (2021)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Cook, W., Lov\u00e1sz, L., Seymour, P.D., et al.: Combinatorial optimization: papers from the DIMACS Special Year, vol. 20. American Mathematical Soc. (1995)","DOI":"10.1090\/dimacs\/020"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-93031-2_12","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"M Deudon","year":"2018","unstructured":"Deudon, M., Cournut, P., Lacoste, A., Adulyasak, Y., Rousseau, L.-M.: Learning heuristics for the TSP by policy gradient. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 170\u2013181. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_12"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Fu, Z.H., Qiu, K.B., Zha, H.: Generalize a small pre-trained model to arbitrarily large tsp instances. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 7474\u20137482 (2021)","DOI":"10.1609\/aaai.v35i8.16916"},{"key":"31_CR11","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A., Bengio, Y.: Deep Learning, vol. 1. MIT press, Cambridge (2016)"},{"key":"31_CR12","unstructured":"Google, I.: Google optimization tools(or-tools) (2018). https:\/\/github.com\/google\/or-tools"},{"key":"31_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/b101971","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G Gutin","year":"2006","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations, vol. 12. Springer, Cham (2006). https:\/\/doi.org\/10.1007\/b101971"},{"key":"31_CR14","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"31_CR15","unstructured":"Helsgaun, K.: An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems: Technical report (2017)"},{"issue":"2","key":"31_CR16","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":"31_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield, J.J., Tank, D.W.: Neural computation of decisions in optimization problems. Biol. Cybern. 52(3), 141\u2013152 (1985)","journal-title":"Biol. Cybern."},{"key":"31_CR18","unstructured":"Joshi, C.K., Cappart, Q., Rousseau, L.M., Laurent, T., Bresson, X.: Learning tsp requires rethinking generalization. arXiv preprint arXiv:2006.07054 (2020)"},{"key":"31_CR19","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":"31_CR20","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0927-0507(05)80121-5","volume":"7","author":"M J\u00fcnger","year":"1995","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G.: The traveling salesman problem. Handbooks Oper. Res. Manage. Sci. 7, 225\u2013330 (1995)","journal-title":"Handbooks Oper. Res. Manage. Sci."},{"key":"31_CR21","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. 6348\u20136358 (2017)"},{"key":"31_CR22","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)"},{"key":"31_CR23","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 (2018)"},{"issue":"1","key":"31_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13673-020-00226-w","volume":"10","author":"W Li","year":"2020","unstructured":"Li, W., Ding, Y., Yang, Y., Sherratt, R.S., Park, J.H., Wang, J.: Parameterized algorithms of fundamental np-hard problems: a survey. Human-Centric Comput. Inf. Sci. 10(1), 1\u201324 (2020)","journal-title":"Human-Centric Comput. Inf. Sci."},{"key":"31_CR25","unstructured":"Li, Z., Chen, Q., Koltun, V.: Combinatorial optimization with graph convolutional networks and guided tree search. In: Advances in Neural Information Processing Systems, vol. 31 (2018)"},{"key":"31_CR26","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001","volume-title":"Information, Physics, and Computation","author":"M Mezard","year":"2009","unstructured":"Mezard, M., Montanari, A.: Information, Physics, and Computation. Oxford University Press, Oxford (2009)"},{"key":"31_CR27","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, pp. 9839\u20139849 (2018)"},{"key":"31_CR28","doi-asserted-by":"crossref","unstructured":"Nowak, A., Villar, S., Bandeira, A.S., Bruna, J.: A note on learning algorithms for quadratic assignment with graph neural networks. In: Proceeding of the 34th International Conference on Machine Learning (ICML), vol. 1050, p. 22 (2017)","DOI":"10.1109\/DSW.2018.8439919"},{"key":"31_CR29","unstructured":"Optimization, G.: Gurobi optimizer reference manual (2018). www.gurobi.com"},{"key":"31_CR30","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Courier Corporation (1998)"},{"key":"31_CR31","doi-asserted-by":"crossref","unstructured":"Prates, M., Avelar, P.H., Lemos, H., Lamb, L.C., Vardi, M.Y.: Learning to solve np-complete problems: a graph neural network for decision TSP. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 4731\u20134738 (2019)","DOI":"10.1609\/aaai.v33i01.33014731"},{"issue":"1","key":"31_CR32","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2008","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., Hagenbuchner, M., Monfardini, G.: The graph neural network model. IEEE Trans. Neural Netw. 20(1), 61\u201380 (2008)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"1","key":"31_CR33","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"KA Smith","year":"1999","unstructured":"Smith, K.A.: Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS J. Comput. 11(1), 15\u201334 (1999)","journal-title":"INFORMS J. Comput."},{"key":"31_CR34","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1007\/s13042-022-01516-8","volume":"13","author":"N Sultana","year":"2022","unstructured":"Sultana, N., Chan, J., Sarwar, T., Qin, A.: Learning to optimise general TSP instances. Int. J. Mach. Learn. Cybern. 13, 2213\u20132228 (2022)","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"31_CR35","first-page":"3104","volume":"27","author":"I Sutskever","year":"2014","unstructured":"Sutskever, I., Vinyals, O., Le, Q.V.: Sequence to sequence learning with neural networks. Adv. Neural. Inf. Process. Syst. 27, 3104\u20133112 (2014)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"31_CR36","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT press, Cambridge (2018)"},{"key":"31_CR37","unstructured":"Chvatal, V., Applegate, D.L., Bixby, R.E., Cook, W.J.: Concorde TSP solver (2006). www.math.uwaterloo.ca\/tsp\/concorde"},{"key":"31_CR38","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, pp. 5998\u20136008 (2017)"},{"key":"31_CR39","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)"},{"key":"31_CR40","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. Comput. Sci. 28 (2015)"},{"key":"31_CR41","unstructured":"Xing, Z., Tu, S., Xu, L.: Solve traveling salesman problem by monte Carlo tree search and deep neural network. arXiv preprint arXiv:2005.06879 (2020)"},{"key":"31_CR42","doi-asserted-by":"crossref","unstructured":"Yang, H.: Extended attention mechanism for TSP problem. In: 2021 International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138. IEEE (2021)","DOI":"10.1109\/IJCNN52387.2021.9533472"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Machine Learning \u2013 ICANN 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44216-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T07:07:16Z","timestamp":1695280036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44216-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442155","9783031442162"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44216-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICANN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Neural Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Heraklion","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icann2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/e-nns.org\/icann2023\/","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":"easyacademia.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"947","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":"426","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":"22","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":"45% - 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.4","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"type of other papers accepted  : 9 Abstract","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)"}}]}}