{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T14:31:23Z","timestamp":1787927483283,"version":"build-2784847793"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819219254","type":"print"},{"value":"9789819219261","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:00:00Z","timestamp":1782777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:00:00Z","timestamp":1782777600000},"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":[[2027]]},"DOI":"10.1007\/978-981-92-1926-1_11","type":"book-chapter","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T15:33:51Z","timestamp":1782747231000},"page":"128-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Attention-Based Approach for\u00a0Solving the\u00a0Selective Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Kaitong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenglai","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,30]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.ejor.2012.01.036","volume":"220","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107, N., Uro\u0161evi\u0107, D., Ili\u0107, A., et al.: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 220(1), 270\u2013285 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR2","first-page":"21188","volume":"33","author":"YD Kwon","year":"2020","unstructured":"Kwon, Y.D., Choo, J., Kim, B., Yoon, I., Gwon, Y., Min, S.: Pomo: policy optimization with multiple optima for reinforcement learning. Adv. Neural. Inf. Process. Syst. 33, 21188\u201321198 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39(2), 188\u2013205 (2005). https:\/\/doi.org\/10.1287\/trsc.1030.0079","journal-title":"Transp. Sci."},{"issue":"9","key":"11_CR4","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1016\/j.cor.2011.10.025","volume":"39","author":"JG Rakke","year":"2012","unstructured":"Rakke, J.G., Christiansen, M., Fagerholt, K., Laporte, G.: The traveling salesman problem with draft limits. Comput. Oper. Res. 39(9), 2161\u20132167 (2012)","journal-title":"Comput. Oper. Res."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1007\/s11590-014-0788-9","volume":"11","author":"R Todosijevi\u0107","year":"2017","unstructured":"Todosijevi\u0107, R., Mjirda, A., Mladenovi\u0107, M., Hanafi, S., Gendron, B.: A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim. Lett. 11, 1047\u20131056 (2017)","journal-title":"Optim. Lett."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10732-019-09406-z","volume":"26","author":"S Gelareh","year":"2020","unstructured":"Gelareh, S., Gendron, B., Hanafi, S., Neamatian Monemi, R., Todosijevi\u0107, R.: The selective traveling salesman problem with draft limits. J. Heurist. 26, 339\u2013352 (2020)","journal-title":"J. Heurist."},{"issue":"6","key":"11_CR7","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1287\/opre.11.6.972","volume":"11","author":"JD Little","year":"1963","unstructured":"Little, J.D., Murty, K.G., Sweeney, D.W., Karel, C.: An algorithm for the traveling salesman problem. Oper. Res. 11(6), 972\u2013989 (1963)","journal-title":"Oper. Res."},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM (JACM) 9(1), 61\u201363 (1962)","journal-title":"J. ACM (JACM)"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Montero, A., Mendez-Diaz, I., Jose Miranda-Bront, J.: An integer programming approach for the time-dependent traveling salesman problem with time windows. Comput. Oper. Res. 88, 280\u2013289 (2017). https:\/\/doi.org\/10.1016\/j.cor.2017.06.026","DOI":"10.1016\/j.cor.2017.06.026"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Karabulut, K., Tasgetiren, M.F.: A variable iterated greedy algorithm for the traveling salesman problem with time windows. Inf. Sci. 279, 383\u2013395 (2014). https:\/\/doi.org\/10.1016\/j.ins.2014.03.127","DOI":"10.1016\/j.ins.2014.03.127"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Sun, L.: Genetic algorithm for tsp problem. In: Proceedings of the 2015 International Industrial Informatics and Computer Engineering Conference, pp. 1436\u20131439 (2015)","DOI":"10.2991\/iiicec-15.2015.319"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Lu, L.C., Yue, T.W.: Mission-oriented ant-team ACO for min-max MTSP. Appl. Soft Comput. 76, 436\u2013444 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2018.11.048","DOI":"10.1016\/j.asoc.2018.11.048"},{"key":"11_CR13","unstructured":"Li, Q., Cao, Z., Ma, Y., Wu, Y., Gong, Y.J.: Diversity optimization for travelling salesman problem via deep reinforcement learning (2025). https:\/\/arxiv.org\/abs\/2501.00884"},{"issue":"9","key":"11_CR14","doi-asserted-by":"publisher","first-page":"5057","DOI":"10.1109\/TNNLS.2021.3068828","volume":"33","author":"Y Wu","year":"2021","unstructured":"Wu, Y., Song, W., Cao, Z., Zhang, J., Lim, A.: Learning improvement heuristics for solving routing problems. IEEE Trans. Neural Networks Learn. Syst. 33(9), 5057\u20135069 (2021)","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"11_CR15","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 (2018)"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Yan, D., Ou, B., Guan, Q., Zhu, Z., Cao, H.: Edge-driven multiple trajectory attention model for vehicle routing problems. Appl. Sci.-Basel 15(5) (2025). https:\/\/doi.org\/10.3390\/app15052679","DOI":"10.3390\/app15052679"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Saad, S., Wan Jaafar, W.N., Jamil, S.J.: Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound. In: AIP Conference Proceedings. vol. 1522, pp. 1406\u20131411. American Institute of Physics (2013)","DOI":"10.1063\/1.4801294"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ejor.2013.10.042","volume":"235","author":"M Battarra","year":"2014","unstructured":"Battarra, M., Pessoa, A.A., Subramanian, A., Uchoa, E.: Exact algorithms for the traveling salesman problem with draft limits. Eur. J. Oper. Res. 235(1), 115\u2013128 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Yang, X., Wang, J.S.: Application of improved ant colony optimization algorithm on traveling salesman problem. In: 2016 Chinese Control and Decision Conference (CCDC), pp. 2156\u20132160. IEEE (2016)","DOI":"10.1109\/CCDC.2016.7531342"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Duarte, B., de\u00a0Oliveira, L.C., Teixeira, M., Barbosa, M.A.: A comparison of genetic and memetic algorithms applied to the traveling salesman problem with draft limits. In: 2021 XLVII Latin American Computing Conference (CLEI), pp. 1\u201310. IEEE (2021)","DOI":"10.1109\/CLEI53233.2021.9640014"},{"key":"11_CR21","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems, pp. 2692\u20132700 (2015)"},{"key":"11_CR22","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: International Conference on Learning Representations (2017)"},{"key":"11_CR23","unstructured":"Chen, X., Tian, Y.: Learning to perform local rewriting for combinatorial optimization. In: Advances in Neural Information Processing Systems, pp. 6278\u20136289 (2019)"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Bi, J., et al.: Learning to handle complex constraints for vehicle routing problems. In: Advances in Neural Information Processing Systems 37 (NeurIPS 2024) (2024)","DOI":"10.52202\/079017-2964"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"11_CR26","unstructured":"Ioffe, S., Szegedy, C.: Batch normalization: accelerating deep network training by reducing internal covariate shift. In: International Conference on Machine Learning, pp. 448\u2013456 (2015)"},{"key":"11_CR27","unstructured":"Helsgaun, K.: LKH-3 (version 3.0.7) (2017). http:\/\/webhotel4.ruc.dk\/~keld\/research\/LKH-3\/, a heuristic solver for the Traveling Salesman Problem and its variants"}],"container-title":["Lecture Notes in Computer Science","Data Science: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-1926-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T14:07:15Z","timestamp":1787926035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-1926-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,30]]},"ISBN":["9789819219254","9789819219261"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-1926-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,30]]},"assertion":[{"value":"30 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2026","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":"pakdd2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pakdd2026.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}