{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T21:14:51Z","timestamp":1772831691464,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:00:00Z","timestamp":1722902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:00:00Z","timestamp":1722902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72071116"],"award-info":[{"award-number":["72071116"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007928","name":"Ningbo Municipal Bureau of Science and Technology","doi-asserted-by":"publisher","award":["2021Z173"],"award-info":[{"award-number":["2021Z173"]}],"id":[{"id":"10.13039\/501100007928","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s12293-024-00428-0","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T11:03:49Z","timestamp":1722942229000},"page":"337-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Gase: graph attention sampling with edges fusion for solving vehicle routing problems"],"prefix":"10.1007","volume":"16","author":[{"given":"Zhenwei","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ruibin","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Fazlullah","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[]},{"given":"Tiehua","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,6]]},"reference":[{"key":"428_CR1","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications","DOI":"10.1137\/1.9781611973594"},{"issue":"1","key":"428_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1080\/00207543.2021.2013566","volume":"61","author":"R Bai","year":"2023","unstructured":"Bai R, Chen X, Chen Z-L, Cui T, Gong S, He W, Jiang X, Jin H, Jin J, Kendall G et al (2023) Analytics and machine learning in vehicle routing research. Int J Prod Res 61(1):4\u201330","journal-title":"Int J Prod Res"},{"issue":"2","key":"428_CR3","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.ejor.2020.10.037","volume":"292","author":"N Xue","year":"2021","unstructured":"Xue N, Bai R, Qu R, Aickelin U (2021) A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem. Eur J Oper Res 292(2):500\u2013514","journal-title":"Eur J Oper Res"},{"key":"428_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2020.102167","volume":"145","author":"W Yang","year":"2021","unstructured":"Yang W, Ke L, Wang DZW, Lam JSL (2021) A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates. Transp Res Part E Logist Transp Rev 145:102167","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"5","key":"428_CR5","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1051\/ro\/2019080","volume":"54","author":"B Chen","year":"2020","unstructured":"Chen B, Qu R, Bai R, Laesanklang W (2020) A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes. RAIRO Oper Res 54(5):1467\u20131494","journal-title":"RAIRO Oper Res"},{"issue":"3","key":"428_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MCI.2023.3277768","volume":"18","author":"S Liu","year":"2023","unstructured":"Liu S, Zhang Y, Tang K, Yao X (2023) How good is neural combinatorial optimization? A systematic evaluation on the traveling salesman problem. IEEE Comput Intell Mag 18(3):14\u201328","journal-title":"IEEE Comput Intell Mag"},{"issue":"7540","key":"428_CR7","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Rusu AA, Veness J, Bellemare MG, Graves A, Riedmiller M, Fidjeland AK, Ostrovski G, Petersen S, Beattie C, Sadik A, Antonoglou I, King H, Kumaran D, Wierstra D, Legg S, Hassabis D (2015) Human-level control through deep reinforcement learning. Nature 518(7540):529\u2013533","journal-title":"Nature"},{"key":"428_CR8","first-page":"66","volume":"6","author":"X Chen","year":"2022","unstructured":"Chen X, Bai R, Qu R, Dong H (2022) Cooperative double-layer genetic programming hyper-heuristic for online container terminal truck dispatching. IEEE Trans Evol Comput 6:66","journal-title":"IEEE Trans Evol Comput"},{"key":"428_CR9","doi-asserted-by":"crossref","unstructured":"Chen X, Bai R, Qu R, Dong H, Chen J (2020) A data-driven genetic programming heuristic for real-world dynamic seaport container terminal truck dispatching. In: 2020 IEEE congress on evolutionary computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC48606.2020.9185659"},{"issue":"1","key":"428_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TRO.2022.3200138","volume":"39","author":"M Lauri","year":"2023","unstructured":"Lauri M, Hsu D, Pajarinen J (2023) Partially observable Markov decision processes in robotics: a survey. IEEE Trans Robot 39(1):21\u201340","journal-title":"IEEE Trans Robot"},{"key":"428_CR11","first-page":"66","volume":"28","author":"O Vinyals","year":"2015","unstructured":"Vinyals O, Fortunato M, Jaitly N (2015) Pointer networks. Adv Neural Inf Process Syst 28:66","journal-title":"Adv Neural Inf Process Syst"},{"key":"428_CR12","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Advances in neural information processing systems, vol 30"},{"key":"428_CR13","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers K, Ramaekers K, Van Nieuwenhuyse I (2016) The vehicle routing problem: state of the art classification and review. Comput Ind Eng 99:300\u2013313","journal-title":"Comput Ind Eng"},{"issue":"6","key":"428_CR14","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1109\/TCYB.2019.2962865","volume":"51","author":"L Feng","year":"2021","unstructured":"Feng L, Huang Y, Zhou L, Zhong J, Gupta A, Tang K, Tan KC (2021) Explicit evolutionary multitasking for combinatorial optimization: a case study on capacitated vehicle routing problem. IEEE Trans Cybernet 51(6):3143\u20133156","journal-title":"IEEE Trans Cybernet"},{"key":"428_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cie.2017.05.004","volume":"109","author":"KKH Ng","year":"2017","unstructured":"Ng KKH, Lee CKM, Zhang SZ, Wu K, Ho W (2017) A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion. Comput Ind Eng 109:151\u2013168","journal-title":"Comput Ind Eng"},{"key":"428_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118812","volume":"213","author":"P Kalatzantonakis","year":"2023","unstructured":"Kalatzantonakis P, Sifaleras A, Samaras N (2023) A reinforcement learning-variable neighborhood search method for the capacitated vehicle routing problem. Expert Syst Appl 213:118812","journal-title":"Expert Syst Appl"},{"issue":"2","key":"428_CR17","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.ejor.2021.10.032","volume":"300","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Bai R, Qu R, Tu C, Jin J (2022) A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties. Eur J Oper Res 300(2):418\u2013427","journal-title":"Eur J Oper Res"},{"key":"428_CR18","unstructured":"Zaremba W, Sutskever I, Vinyals O (2014) Recurrent neural network regularization. arXiv preprint arXiv:1409.2329"},{"key":"428_CR19","unstructured":"Bello I, Pham H, Le QV, Norouzi M, Bengio S (2016) Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940"},{"key":"428_CR20","first-page":"66","volume":"31","author":"M Nazari","year":"2018","unstructured":"Nazari M, Oroojlooy A, Snyder L, Tak\u00e1c M (2018) Reinforcement learning for solving the vehicle routing problem. Adv Neural Inf Process Syst 31:66","journal-title":"Adv Neural Inf Process Syst"},{"key":"428_CR21","unstructured":"Google Optimization Tools (2024) Google Optimization Tools. Online. https:\/\/developers.google.com\/optimization\/. Accessed 26 March 2024"},{"key":"428_CR22","unstructured":"Kool W, Van\u00a0Hoof H, Welling M (2019) Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475"},{"key":"428_CR23","first-page":"66","volume":"30","author":"A Vaswani","year":"2017","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser \u0141, Polosukhin I (2017) Attention is all you need. Adv Neural Inf Process Syst 30:66","journal-title":"Adv Neural Inf Process Syst"},{"key":"428_CR24","first-page":"21188","volume":"33","author":"Y-D Kwon","year":"2020","unstructured":"Kwon Y-D, Choo J, Kim B, Yoon I, Gwon Y, Min S (2020) Pomo: policy optimization with multiple optima for reinforcement learning. Adv Neural Inf Process Syst 33:21188\u201321198","journal-title":"Adv Neural Inf Process Syst"},{"key":"428_CR25","unstructured":"Khalil E, Dai H, Zhang Y, Dilkina B, Song L (2017) Learning combinatorial optimization algorithms over graphs. In: Advances in neural information processing systems, vol 30"},{"key":"428_CR26","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.neucom.2022.08.005","volume":"508","author":"K Lei","year":"2022","unstructured":"Lei K, Guo P, Wang Y, Wu X, Zhao W (2022) Solve routing problems with a residual edge-graph attention neural network. Neurocomputing 508:79\u201398","journal-title":"Neurocomputing"},{"key":"428_CR27","unstructured":"Joshi CK, Cappart Q, Rousseau L-M, Laurent T (2020) Learning the travelling salesperson problem requires rethinking generalization. arXiv preprint arXiv:2006.07054"},{"key":"428_CR28","unstructured":"Ma Q, Ge S, He D, Thaker D, Drori I (2019) Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning. arXiv preprint arXiv:1911.04936"},{"issue":"11","key":"428_CR29","doi-asserted-by":"publisher","first-page":"7208","DOI":"10.1109\/TITS.2020.3003163","volume":"22","author":"J Zhao","year":"2021","unstructured":"Zhao J, Mao M, Zhao X, Zou J (2021) A hybrid of deep reinforcement learning and local search for the vehicle routing problems. IEEE Trans Intell Transp Syst 22(11):7208\u20137218","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"428_CR30","unstructured":"Ioffe S, Szegedy C (2015) Batch normalization: accelerating deep network training by reducing internal covariate shift. In: International conference on machine learning. PMLR, pp 448\u2013456"},{"key":"428_CR31","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:1710.10903"},{"key":"428_CR32","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"key":"428_CR33","doi-asserted-by":"crossref","unstructured":"Szegedy C, Ioffe S, Vanhoucke V, Alemi A (2017) Inception-v4, inception-resnet and the impact of residual connections on learning. In: Proceedings of the AAAI conference on artificial intelligence, vol 31, no 1","DOI":"10.1609\/aaai.v31i1.11231"},{"key":"428_CR34","unstructured":"Zhang T, Liu Y, Chen X, Huang X, Zhu F, Zheng X (2021) Gps: a policy-driven sampling approach for graph representation learning. arXiv preprint arXiv:2112.14482"},{"key":"428_CR35","unstructured":"Fey M, Lenssen JE (2019) Fast graph representation learning with pytorch geometric. arXiv preprint arXiv:1903.02428"},{"key":"428_CR36","unstructured":"Mnih V, Badia AP, Mirza M, Graves A, Lillicrap T, Harley T, Silver D, Kavukcuoglu K (2016) Asynchronous methods for deep reinforcement learning. In: International conference on machine learning (PMLR), pp 1928\u20131937"},{"key":"428_CR37","unstructured":"Sutton RS, McAllester D, Singh S, Mansour Y (1999) Policy gradient methods for reinforcement learning with function approximation. In: Advances in neural information processing systems, vol 12"},{"issue":"3","key":"428_CR38","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa E, Pecin D, Pessoa A, Poggi M, Vidal T, Subramanian A (2017) New benchmark instances for the capacitated vehicle routing problem. Eur J Oper Res 257(3):845\u2013858","journal-title":"Eur J Oper Res"},{"key":"428_CR39","unstructured":"Gurobi Optimization, LLC (2024) Gurobi Optimizer. https:\/\/www.gurobi.com\/. Accessed 26 March 2024"},{"issue":"2","key":"428_CR40","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516 arxiv: 169020","journal-title":"Oper Res"},{"issue":"10","key":"428_CR41","doi-asserted-by":"publisher","first-page":"11107","DOI":"10.1109\/TCYB.2021.3089179","volume":"52","author":"Y Xu","year":"2021","unstructured":"Xu Y, Fang M, Chen L, Xu G, Du Y, Zhang C (2021) Reinforcement learning with multiple relational attention for solving vehicle routing problems. IEEE Trans Cybernet 52(10):11107\u201311120","journal-title":"IEEE Trans Cybernet"},{"key":"428_CR42","doi-asserted-by":"crossref","unstructured":"Senuma Y, Wang Z, Nakano Y, Ohya J (2022) Gear: a graph edge attention routing algorithm solving combinatorial optimization problem with graph edge cost. In: Proceedings of the 10th ACM SIGSPATIAL international workshop on analytics for big geospatial data, pp 8\u201316","DOI":"10.1145\/3557917.3567616"},{"key":"428_CR43","unstructured":"Kingma DP, Ba J (2014) Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980"},{"key":"428_CR44","unstructured":"Glorot X, Bengio Y (2010) Understanding the difficulty of training deep feedforward neural networks. In: Proceedings of the thirteenth international conference on artificial intelligence and statistics (JMLR workshop and conference proceedings), pp 249\u2013256"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-024-00428-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-024-00428-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-024-00428-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T03:20:37Z","timestamp":1726197637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-024-00428-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,6]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["428"],"URL":"https:\/\/doi.org\/10.1007\/s12293-024-00428-0","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4449177\/v1","asserted-by":"object"}]},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,6]]},"assertion":[{"value":"20 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}