{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T16:10:28Z","timestamp":1743178228032,"version":"3.40.3"},"reference-count":44,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"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,12,2]]},"DOI":"10.1109\/secon64284.2024.10934896","type":"proceedings-article","created":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:56:29Z","timestamp":1743130589000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["Budget-Constrained Traveling Salesman Problem: a Cooperative Multi-Agent Reinforcement Learning Approach"],"prefix":"10.1109","author":[{"given":"King To","family":"Mak","sequence":"first","affiliation":[{"name":"California State University,Department of Computer Science,Dominguez Hills"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Gonzalez","sequence":"additional","affiliation":[{"name":"California State University,Department of Computer Science,Dominguez Hills"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zari","family":"Magnaye","sequence":"additional","affiliation":[{"name":"California State University,Department of Computer Science,Dominguez Hills"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jessica","family":"Gonzalez","sequence":"additional","affiliation":[{"name":"California State University,Department of Computer Science,Dominguez Hills"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yutian","family":"Chen","sequence":"additional","affiliation":[{"name":"California State University,Economics Department,Long Beach"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Tang","sequence":"additional","affiliation":[{"name":"California State University,Department of Computer Science,Dominguez Hills"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"volume-title":"Haversine formula","key":"ref1"},{"volume-title":"Miller-tucker-zemlin (mtz) subtour elimination constraint","key":"ref2"},{"volume-title":"Pytorch deep learning libraries","key":"ref3"},{"volume-title":"Traveling salesman tour of us capital cities","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.11.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2743240"},{"key":"ref7","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016","journal-title":"CoRR"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00121-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.09.076"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1016\/j.cosrev.2021.100369","article-title":"A comprehensive survey on the multiple traveling salesman problem: Applications, approaches and taxonomy","volume":"40","author":"Cheikhrouhou","year":"2021","journal-title":"Computer Science Review"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2504603"},{"key":"ref13","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. of NIPS","author":"Dai","year":"2017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICECA.2018.8474912"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA51294.2020.00013"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3124466"},{"journal-title":"20th Int. Conf Mach. Learn. (ICML-03)","article-title":"Correlated-q learning","author":"Greenwald","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2014.2307332"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/s0167-739x(00)00044-3"},{"article-title":"Multiagent reinforcement learning: Theoretical framework and an algorithm","volume-title":"Proc. of ICML-98","author":"Hu","key":"ref21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3390\/s21041278"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.comnet.2018.10.018","article-title":"Mobile robots in wireless sensor networks: A survey on tasks","volume":"148","author":"Huang","year":"2019","journal-title":"Computer Networks"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2017.2689013"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913495721"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90138-Y"},{"key":"ref27","article-title":"An algorithm for distributed reinforcement learning in cooperative multi-agent systems","volume-title":"Proc. of ICML","author":"Lauer","year":"2000"},{"article-title":"Markov games as a framework for multi-agent rein-forcement learning","volume-title":"Proceedings of the ICML","author":"Littman","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2012.2229309"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"ref31","article-title":"Reinforcement learning for solving the vehicle routing problem","volume-title":"S. Bengio, editor, Advances in Neural Information Processing Systems","volume":"31","author":"Nazari","year":"2018"},{"key":"ref32","article-title":"A convergent multi-agent reinforcement learning algorithm for dynamic data collection in robotic sensor networks","author":"Patil","year":"2024","journal-title":"Technical report, CSUDH-TR-2024\u20131"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MASS62177.2024.00041"},{"article-title":"Prize-collecting tsp with a budget constraint","volume-title":"25th Annual European Symposium on Algorithms (ESA 2017)","author":"Paul","key":"ref34"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1109\/ICC45041.2023.10279682","article-title":"Prize-collecting traveling salesman problem: a reinforcement learning approach","volume-title":"Proc. of IEEE ICC","author":"Ruiz","year":"2023"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2013.2291811"},{"volume-title":"The cost-constrained traveling salesman problem","year":"1991","author":"Sokkappa","key":"ref37"},{"volume-title":"Reinforcement Learning, An Introduction","year":"2020","author":"Sutton","key":"ref38"},{"issue":"2","key":"ref39","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","article-title":"Orienteering problem: A survey of recent variants, solution approaches and applications","volume":"255","author":"Vansteenwegen","year":"2016","journal-title":"European Journal of Oper. Res."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2016.2533390"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2018.2863293"},{"key":"ref42","article-title":"Informative path planning for mobile sensing with reinforcement learning","author":"Wei","year":"2020","journal-title":"IEEE INFOCOM"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848171"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3207011"}],"event":{"name":"2024 21st Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)","start":{"date-parts":[[2024,12,2]]},"location":"Phoenix, AZ, USA","end":{"date-parts":[[2024,12,4]]}},"container-title":["2024 21st Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10934812\/10934772\/10934896.pdf?arnumber=10934896","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T15:22:41Z","timestamp":1743175361000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10934896\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/secon64284.2024.10934896","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]}}}