{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T07:40:23Z","timestamp":1737445223939,"version":"3.33.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:00:00Z","timestamp":1728172800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:00:00Z","timestamp":1728172800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,10,6]]},"DOI":"10.1109\/smc54092.2024.10832046","type":"proceedings-article","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:39:20Z","timestamp":1737398360000},"page":"1678-1683","source":"Crossref","is-referenced-by-count":0,"title":["Learning Node-Pair Insertion for the Pickup and Delivery Problem with Time Windows"],"prefix":"10.1109","author":[{"given":"Zhanhong","family":"Fang","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-Sen University,Guangzhou,China"}]},{"given":"Jinbiao","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-Sen University,Guangzhou,China"}]},{"given":"Zizhen","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-Sen University,Guangzhou,China"}]},{"given":"Dawei","family":"Su","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-Sen University,Guangzhou,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.05.028"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.31.2.170"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90319-Q"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0881"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.20177"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(99)00016-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-004-0173-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.05.012"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0135"},{"key":"ref10","article-title":"Pointer networks","volume":"28","author":"Vinyals","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref11","article-title":"Attention, learn to solve routing problems!","volume-title":"International Conference on Learning Repre-sentations","author":"Kool","year":"2019"},{"key":"ref12","first-page":"21188","article-title":"Pomo: Policy optimization with multiple optima for reinforcement learning","volume":"33","author":"Kwon","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.29.1.17"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3056120"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3068828"},{"key":"ref16","first-page":"11096","article-title":"Learning to iteratively solve routing problems with dual-aspect col-laborative transformer","volume":"34","author":"Ma","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/662"},{"key":"ref18","article-title":"An efficient graph convolutional network technique for the travelling salesman problem","author":"Joshi","year":"2019","journal-title":"arXiv preprint"},{"key":"ref19","article-title":"Difusco: Graph-based diffusion solvers for combinatorial optimization","volume":"36","author":"Sun","year":"2024","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2018.0837"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2001.974461"},{"volume-title":"Gurobi Optimizer Reference Manual","year":"2023","key":"ref22"},{"key":"ref23","article-title":"An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems","volume":"12","author":"Helsgaun","year":"2017","journal-title":"Roskilde: Roskilde University"}],"event":{"name":"2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","start":{"date-parts":[[2024,10,6]]},"location":"Kuching, Malaysia","end":{"date-parts":[[2024,10,10]]}},"container-title":["2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10830919\/10830920\/10832046.pdf?arnumber=10832046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T07:03:08Z","timestamp":1737442988000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10832046\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/smc54092.2024.10832046","relation":{},"subject":[],"published":{"date-parts":[[2024,10,6]]}}}