{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:10:54Z","timestamp":1778789454635,"version":"3.51.4"},"reference-count":78,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U2001210"],"award-info":[{"award-number":["U2001210"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Open J. Commun. Soc."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/ojcoms.2026.3690522","type":"journal-article","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T20:05:08Z","timestamp":1778011508000},"page":"4660-4680","source":"Crossref","is-referenced-by-count":0,"title":["Learn to Solve Constrained Routing Problems in V2V Social Vehicle Networks"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-1271-1678","authenticated-orcid":false,"given":"Wei","family":"He","sequence":"first","affiliation":[{"name":"School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4746-7313","authenticated-orcid":false,"given":"Junliang","family":"Ye","sequence":"additional","affiliation":[{"name":"School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Low-Altitude Economy and Big Data Industry, Wenhua College, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3204-5241","authenticated-orcid":false,"given":"Xiaohu","family":"Ge","sequence":"additional","affiliation":[{"name":"School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0782-7807","authenticated-orcid":false,"given":"Tao","family":"Han","sequence":"additional","affiliation":[{"name":"School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3390\/jsan9020022"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.061411.00019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2013.09.008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3390\/s22155535"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.07.059"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2453481"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2899627"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2016.2607748"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108558"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/s20143945"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.iot.2023.100837"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/09540091.2023.2272583"},{"issue":"1","key":"ref13","first-page":"93","article-title":"Routing protocols for VANETs: A taxonomy, evaluation and analysis","volume":"5","author":"Lakas","year":"2020","journal-title":"Adv. Sci., Technol. Eng. Syst. J."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2012.12.023"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1049\/els2.12069"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/s19163589"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108324"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.246"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288113"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2021.102696"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/dac.5348"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.vehcom.2021.100353"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.vehcom.2024.100779"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/itl2.323"},{"key":"ref27","article-title":"A comprehensive and configurable simulation environment for named data networking in vehicular networks","volume":"230","author":"Araujo","year":"2023","journal-title":"Comput. Netw."},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2021.103168"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3152767"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5585896"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3390\/app131910766"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-023-00532-z"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/595"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"ref36","article-title":"Pointer networks","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst. (NeurIPS)","author":"Vinyals"},{"key":"ref37","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kool"},{"key":"ref38","article-title":"An efficient graph convolutional network technique for the travelling salesman problem","author":"Joshi","year":"2019","journal-title":"arXiv:1906.01227"},{"key":"ref39","article-title":"NeuroLKH: Combining deep learning model with lin-kernighan-helsgaun heuristic for solving the traveling salesman problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Xin"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.3389\/ffutr.2025.1524232"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5477"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411873"},{"key":"ref43","first-page":"55","article-title":"A distributed reinforcement learning scheme for network routing","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Boyan"},{"key":"ref44","first-page":"945","article-title":"Predictive Q-routing: A memory-based reinforcement learning approach to adaptive traffic control","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"8","author":"Choi"},{"key":"ref45","first-page":"1109","article-title":"A deep reinforcement learning-based intelligent qos-optimized efficient routing algorithm for vehicular networks (DRLIQ)","volume":"81","author":"Ye","year":"2024","journal-title":"Alexandria Eng. J."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17450"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i25.34892"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/net.22210"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-024-02130-y"},{"key":"ref50","article-title":"A neural column generation approach to the vehicle routing problem with two-dimensional loading and last-in-first-out constraints","volume-title":"Proc. 33rd Int. Joint Conf. Artif. Intell. (IJCAI-24)","author":"Xia"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.3390\/a15060205"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v33i1.27244"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.65109\/xkdr2076"},{"key":"ref54","first-page":"1","article-title":"Learning to optimize: A primer and a benchmark","volume":"23","author":"Chen","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref55","first-page":"1","article-title":"Learning to warm-start fixed-point optimization algorithms","volume":"25","author":"Sambharya","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-023-09512-z"},{"key":"ref57","article-title":"Learning to optimize by differentiable programming","author":"Tao","year":"2026","journal-title":"arXiv:2601.16510"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2025.3608179"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TMLCN.2025.3598739"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-019-00735-2"},{"key":"ref61","article-title":"A closer look at invalid action masking in policy gradient methods","author":"Huang","year":"2020","journal-title":"arXiv:2006.14171"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.3390\/app13148283"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2025.107102"},{"key":"ref64","article-title":"POMO: Policy optimization with multiple optima for reinforcement learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Kwon"},{"key":"ref65","article-title":"Neural combinatorial optimization algorithms for solving vehicle routing problems: A comprehensive survey with perspectives","author":"Wu","year":"2024","journal-title":"arXiv:2406.00415"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.52202\/079017-2964"},{"key":"ref67","article-title":"A deep learning attention model to solve the vehicle routing problem with time windows and pick-up & delivery","author":"Rabecq","year":"2022","journal-title":"arXiv:2212.10399"},{"key":"ref68","first-page":"97","article-title":"DeepTrace: Online graph exploration on epidemic networks under query budget","volume":"11","author":"Yu","year":"2025","journal-title":"IEEE Trans. Signal Inf. Process. Over Netw."},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12842-5_6"},{"issue":"1","key":"ref70","first-page":"128","article-title":"SUMO\u2013simulation of urban mobility: An overview","volume":"10","author":"Behrisch","year":"2018","journal-title":"IEEE Intell. Transp. Syst. Mag."},{"key":"ref71","first-page":"55","article-title":"OMNeT++-discrete event simulation system","volume-title":"Recent Advances in Network Simulation","author":"Varga","year":"2019"},{"key":"ref72","volume-title":"Benchmarking Safe Exploration in Deep Reinforcement Learning","author":"Ray","year":"2019"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.3389\/ffutr.2025.1603726"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3376739"},{"key":"ref75","article-title":"Action mapping for reinforcement learning in continuous environments with constraints","author":"Theile","year":"2024","journal-title":"Reinforcement Learn. J."},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3626"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/190809.190336"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3561"}],"container-title":["IEEE Open Journal of the Communications Society"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8782661\/11343983\/11509301.pdf?arnumber=11509301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:01:00Z","timestamp":1778788860000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11509301\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":78,"URL":"https:\/\/doi.org\/10.1109\/ojcoms.2026.3690522","relation":{},"ISSN":["2644-125X"],"issn-type":[{"value":"2644-125X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}