{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:16:24Z","timestamp":1783149384602,"version":"3.54.6"},"reference-count":69,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106002"],"award-info":[{"award-number":["62106002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["2008085QF308"],"award-info":[{"award-number":["2008085QF308"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.asoc.2026.115379","type":"journal-article","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:58:53Z","timestamp":1778025533000},"page":"115379","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Adaptive heuristic for routing problems via integrated self-attention and convolution in deep reinforcement learning"],"prefix":"10.1016","volume":"199","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4788-6860","authenticated-orcid":false,"given":"Chao","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hua","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.asoc.2026.115379_bib0005","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/j.ejor.2023.07.022","article-title":"A comprehensive survey on the generalized traveling salesman problem","volume":"314","author":"Pop","year":"2024","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115379_bib0010","first-page":"225","article-title":"The traveling salesman problem","volume":"7","author":"J\u00fcnger","year":"1995","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"10.1016\/j.asoc.2026.115379_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2019.100607","article-title":"A novel design of differential evolution for solving discrete traveling salesman problems","volume":"52","author":"Ali","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115379_bib0020","series-title":"The Traveling Salesman Problem and Its Variations","volume":"vol. 12","author":"Gutin","year":"2006"},{"issue":"2","key":"10.1016\/j.asoc.2026.115379_bib0025","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10589-023-00474-3","article-title":"Results for the close-enough traveling salesman problem with a branch-and-bound algorithm","volume":"85","author":"Zhang","year":"2023","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"10.1016\/j.asoc.2026.115379_bib0030","article-title":"Survey of methods of solving TSP along with its implementation using dynamic programming approach","volume":"52","author":"Chauhan","year":"2012","journal-title":"Int. J. Comput. Appl."},{"key":"10.1016\/j.asoc.2026.115379_bib0035","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s001860200239","article-title":"Approximation algorithms for the traveling salesman problem","volume":"56","author":"Monnot","year":"2003","journal-title":"Math. Methods Oper. Res."},{"key":"10.1016\/j.asoc.2026.115379_bib0040","series-title":"The Design of Approximation Algorithms","author":"Williamson","year":"2011"},{"key":"10.1016\/j.asoc.2026.115379_bib0045","series-title":"Approximation Algorithms","volume":"vol. 1","author":"Vazirani","year":"2001"},{"issue":"2","key":"10.1016\/j.asoc.2026.115379_bib0050","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/261342.571216","article-title":"Approximation algorithms for NP-hard problems","volume":"28","author":"Hochba","year":"1997","journal-title":"ACM Sigact News"},{"key":"10.1016\/j.asoc.2026.115379_bib0055","series-title":"2023 IEEE 34th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","first-page":"1","article-title":"Heuristic methods for solving the traveling salesman problem (TSP): a comparative study","author":"Zhang","year":"2023"},{"key":"10.1016\/j.asoc.2026.115379_bib0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2022.105622","article-title":"A survey of recently developed metaheuristics and their comparative analysis","volume":"117","author":"Alorf","year":"2023","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.asoc.2026.115379_bib0065","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02125403","article-title":"Genetic algorithms for the traveling salesman problem","volume":"63","author":"Potvin","year":"1996","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"10.1016\/j.asoc.2026.115379_bib0070","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/4235.974843","article-title":"A hybrid heuristic for the traveling salesman problem","volume":"5","author":"Baraglia","year":"2001","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115379_bib0075","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1109\/TITS.2020.3018903","article-title":"Towards faster vehicle routing by transferring knowledge from customer representation","volume":"23","author":"Feng","year":"2022","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"10.1016\/j.asoc.2026.115379_bib0080","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.asoc.2016.12.027","article-title":"A simulated annealing heuristic for the hybrid vehicle routing problem","volume":"53","author":"Vincent","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115379_bib0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109239","article-title":"A tabu search based approach for the heterogeneous Fleet vehicle routing problem with three-dimensional loading constraints","volume":"126","author":"Meliani","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115379_bib0090","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.asoc.2018.03.048","article-title":"Improving variable neighborhood search to solve the traveling salesman problem","volume":"68","author":"Hore","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115379_bib0095","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s11831-017-9247-y","article-title":"Combinatorial optimization: comparison of heuristic algorithms in travelling salesman problem","volume":"26","author":"Halim","year":"2019","journal-title":"Arch. Comput. Methods Eng."},{"key":"10.1016\/j.asoc.2026.115379_bib0100","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.asoc.2016.02.021","article-title":"Multi-offspring genetic algorithm and its application to the traveling salesman problem","volume":"43","author":"Wang","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115379_bib0105","series-title":"2010 IEEE International Conference on Systems, Man and Cybernetics","first-page":"11","article-title":"Using differential evolution for combinatorial optimization: a general approach","author":"Prado","year":"2010"},{"key":"10.1016\/j.asoc.2026.115379_bib0110","series-title":"Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization","volume":"vol. 175","author":"Onwubolu","year":"2009"},{"key":"10.1016\/j.asoc.2026.115379_bib0115","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","article-title":"Discrete comprehensive learning particle swarm optimization algorithm with metropolis acceptance criterion for traveling salesman problem","volume":"42","author":"Zhong","year":"2018","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115379_bib0120","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s10845-015-1039-3","article-title":"An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem","volume":"29","author":"Nouiri","year":"2018","journal-title":"J. Intell. Manuf."},{"issue":"2","key":"10.1016\/j.asoc.2026.115379_bib0125","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.asoc.2009.08.040","article-title":"An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem","volume":"10","author":"Yang","year":"2010","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115379_bib0130","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.asoc.2019.03.001","article-title":"An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem","volume":"78","author":"Pandiri","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115379_bib0135","series-title":"Asian Conference on Machine Learning","first-page":"1301","article-title":"Learning 3-opt heuristics for traveling salesman problem via deep reinforcement learning","author":"Sui","year":"2021"},{"key":"10.1016\/j.asoc.2026.115379_bib0140","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/j.procs.2022.01.084","article-title":"The neural network methods for solving traveling salesman problem","volume":"199","author":"Shi","year":"2022","journal-title":"Procedia Comput. Sci."},{"key":"10.1016\/j.asoc.2026.115379_bib0145","article-title":"Sequence to sequence learning with neural networks","volume":"27","author":"Sutskever","year":"2014","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.asoc.2026.115379_bib0150","series-title":"Reinforcement Learning: State-of-the-Art","first-page":"3","article-title":"Reinforcement learning and Markov decision processes","author":"Van Otterlo","year":"2012"},{"key":"10.1016\/j.asoc.2026.115379_bib0155","series-title":"Machine Learning Proceedings 1995","first-page":"252","article-title":"Ant-Q: a reinforcement learning approach to the traveling salesman problem","author":"Gambardella","year":"1995"},{"issue":"7676","key":"10.1016\/j.asoc.2026.115379_bib0160","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1038\/nature24270","article-title":"Mastering the game of go without human knowledge","volume":"550","author":"Silver","year":"2017","journal-title":"Nature"},{"issue":"3","key":"10.1016\/j.asoc.2026.115379_bib0165","doi-asserted-by":"crossref","first-page":"1984","DOI":"10.1109\/TCYB.2023.3312476","article-title":"Multiobjective combinatorial optimization using a single deep reinforcement learning model","volume":"54","author":"Wang","year":"2024","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.asoc.2026.115379_bib0170","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107526","article-title":"Deep reinforcement learning for transportation network combinatorial optimization: a survey","volume":"233","author":"Wang","year":"2021","journal-title":"Knowl.-based Syst."},{"issue":"2","key":"10.1016\/j.asoc.2026.115379_bib0175","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TEVC.2022.3233364","article-title":"Neural architecture search as multiobjective optimization benchmarks: problem formulation and performance assessment","volume":"28","author":"Lu","year":"2024","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10.1016\/j.asoc.2026.115379_bib0180","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/TETCI.2021.3139802","article-title":"RL-CSL: a combinatorial optimization method using reinforcement learning and contrastive self-supervised learning","volume":"7","author":"Yuan","year":"2023","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"10.1016\/j.asoc.2026.115379_bib0185","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1016\/j.ins.2022.11.073","article-title":"Solving combinatorial optimization problems over graphs with BERT-based deep reinforcement learning","volume":"619","author":"Wang","year":"2023","journal-title":"Inf. Sci."},{"key":"10.1016\/j.asoc.2026.115379_bib0190","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1016\/j.ins.2022.06.017","article-title":"A graph neural networks-based deep Q-learning approach for job shop scheduling problems in traffic management","volume":"607","author":"Liu","year":"2022","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.asoc.2026.115379_bib0195","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TEVC.2020.3040272","article-title":"Efficient evolutionary search of attention convolutional networks via sampled training and node inheritance","volume":"25","author":"Zhang","year":"2020","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.asoc.2026.115379_bib0200","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/TNNLS.2021.3100554","article-title":"A survey on evolutionary neural architecture search","volume":"34","author":"Liu","year":"2023","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"2","key":"10.1016\/j.asoc.2026.115379_bib0205","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/TEVC.2019.2916183","article-title":"Evolving deep convolutional neural networks for image classification","volume":"24","author":"Sun","year":"2019","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115379_bib0210","article-title":"Pointer networks","volume":"28","author":"Vinyals","year":"2015","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.asoc.2026.115379_bib0215","first-page":"7472","article-title":"NeuroLKH: combining deep learning model with lin-kernighan-helsgaun heuristic for solving the traveling salesman problem","volume":"34","author":"Xin","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"10.1016\/j.asoc.2026.115379_bib0220","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling-salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/j.asoc.2026.115379_bib0225","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.110144","article-title":"Reinforced lin\u2013kernighan\u2013helsgaun algorithms for the traveling salesman problems","volume":"260","author":"Zheng","year":"2023","journal-title":"Knowl.-based Syst."},{"key":"10.1016\/j.asoc.2026.115379_bib0230","author":"Hu"},{"issue":"3","key":"10.1016\/j.asoc.2026.115379_bib0235","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/MCI.2023.3277768","article-title":"How good is neural combinatorial optimization? A systematic evaluation on the traveling salesman problem","volume":"18","author":"Liu","year":"2023","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"1","key":"10.1016\/j.asoc.2026.115379_bib0240","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1109\/TITS.2023.3313688","article-title":"Pareto improver: learning improvement heuristics for multi-objective route planning","volume":"25","author":"Zheng","year":"2024","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"10.1016\/j.asoc.2026.115379_bib0245","author":"Bello"},{"key":"10.1016\/j.asoc.2026.115379_bib0250","author":"Kool"},{"issue":"7","key":"10.1016\/j.asoc.2026.115379_bib0255","doi-asserted-by":"crossref","first-page":"7323","DOI":"10.1109\/TITS.2023.3348034","article-title":"Graph convolutional network based multi-objective meta-deep Q-Learning for eco-routing","volume":"25","author":"Ma","year":"2024","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"10.1016\/j.asoc.2026.115379_bib0260","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1023\/A:1022672621406","article-title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning","volume":"8","author":"Williams","year":"1992","journal-title":"Mach. Learn."},{"key":"10.1016\/j.asoc.2026.115379_bib0265","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"8132","article-title":"Pointerformer: deep reinforced multi-pointer transformer for the traveling salesman problem","volume":"vol. 37","author":"Jin","year":"2023"},{"key":"10.1016\/j.asoc.2026.115379_bib0270","first-page":"21188","article-title":"Pomo: policy optimization with multiple optima for reinforcement learning","volume":"33","author":"Kwon","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.asoc.2026.115379_bib0275","article-title":"Neural combinatorial optimization with heavy decoder: toward large scale generalization","volume":"36","author":"Luo","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.asoc.2026.115379_bib0280","series-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26\u201329, 2018, Proceedings 15","first-page":"170","article-title":"Learning heuristics for the TSP by policy gradient","author":"Deudon","year":"2018"},{"key":"10.1016\/j.asoc.2026.115379_bib0285","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-642-24797-2_4","article-title":"Long short-term memory","author":"Graves","year":"2012","journal-title":"Supervised sequence labelling with recurrent neural networks"},{"key":"10.1016\/j.asoc.2026.115379_bib0290","series-title":"International Conference on Learning Representations","article-title":"A learning-based iterative method for solving vehicle routing problems","author":"Lu","year":"2019"},{"key":"10.1016\/j.asoc.2026.115379_bib0295","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2022.103786","article-title":"Neural large neighborhood search for routing problems","volume":"313","author":"Hottung","year":"2022","journal-title":"Artif. Intell."},{"key":"10.1016\/j.asoc.2026.115379_bib0300","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110831","article-title":"Adaptive large neighborhood search algorithm for the unmanned aerial vehicle routing problem with recharging","volume":"147","author":"Shi","year":"2023","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"10.1016\/j.asoc.2026.115379_bib0305","doi-asserted-by":"crossref","first-page":"5057","DOI":"10.1109\/TNNLS.2021.3068828","article-title":"Learning improvement heuristics for solving routing problems","volume":"33","author":"Wu","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.asoc.2026.115379_bib0310","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s42979-021-00779-2","article-title":"Learning 2-opt heuristics for routing problems via deep reinforcement learning","volume":"2","author":"da Costa","year":"2021","journal-title":"SN Comput. Sci."},{"key":"10.1016\/j.asoc.2026.115379_bib0315","series-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","first-page":"361","article-title":"Learning to control local search for combinatorial optimization","author":"Falkner","year":"2022"},{"key":"10.1016\/j.asoc.2026.115379_bib0320","first-page":"11096","article-title":"Learning to iteratively solve routing problems with dual-aspect collaborative transformer","volume":"34","author":"Ma","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.asoc.2026.115379_bib0325","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.ins.2021.10.025","article-title":"Adaptive operator selection with reinforcement learning","volume":"581","author":"Durgut","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.asoc.2026.115379_bib0330","series-title":"Adaptive Operator Selection for Optimization","author":"Fialho","year":"2010"},{"key":"10.1016\/j.asoc.2026.115379_bib0335","series-title":"International Conference on Optimization and Learning","first-page":"45","article-title":"A learning-based iterated local search algorithm for solving the traveling salesman problem","author":"Karimi-Mamaghan","year":"2021"},{"issue":"4\u20136","key":"10.1016\/j.asoc.2026.115379_bib0340","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1016\/j.neucom.2006.03.013","article-title":"A new approach to solve the traveling salesman problem","volume":"70","author":"Siqueira","year":"2007","journal-title":"Neurocomputing"},{"key":"10.1016\/j.asoc.2026.115379_bib0345","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.cor.2014.11.007","article-title":"Testing local search move operators on the vehicle routing problem with split deliveries and time windows","volume":"56","author":"McNabb","year":"2015","journal-title":"Comput. Oper. Res."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626008276?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626008276?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T06:30:36Z","timestamp":1783146636000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626008276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":69,"alternative-id":["S1568494626008276"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115379","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Adaptive heuristic for routing problems via integrated self-attention and convolution in deep reinforcement learning","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115379","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115379"}}