{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:24:45Z","timestamp":1781367885292,"version":"3.54.1"},"reference-count":46,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T00:00:00Z","timestamp":1728864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T00:00:00Z","timestamp":1728864000000},"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,14]]},"DOI":"10.1109\/iros58592.2024.10802039","type":"proceedings-article","created":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T19:17:39Z","timestamp":1735154259000},"page":"10245-10252","source":"Crossref","is-referenced-by-count":7,"title":["iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning"],"prefix":"10.1109","author":[{"given":"Yifan","family":"Guo","sequence":"first","affiliation":[{"name":"Purdue University,Flight Dynamics &amp; Control\/Hybrid Systems Lab,West Lafayette,IN,47907"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhongqiang","family":"Ren","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Robotics Institute,Pittsburgh,PA,USA,15213"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Wang","sequence":"additional","affiliation":[{"name":"University at Buffalo,Spatial AI &amp; Robotics (SAIR) Lab,Department of Computer Science and Engineering,NY,USA,14260"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2279544"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCA.2019.8899987"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561023"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2023.3266993"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/mnrasl\/slad015"},{"key":"ref7","first-page":"878","article-title":"Learn to solve the min-max multiple traveling salesmen problem with reinforcement learning","volume-title":"Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems","author":"Park"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2018.03.025"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561779"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2022.102816"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCISci.2019.8716483"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2015.127"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i7.26049"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106244"},{"key":"ref15","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":"Advances in Neural Information Processing Systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/iCCECOME.2018.8659266"},{"key":"ref17","article-title":"Pointer networks","volume":"28","author":"Vinyals","year":"2015","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref18","article-title":"Attention, learn to solve routing problems!","author":"Kool","year":"2018"},{"key":"ref19","article-title":"Reinforcement learning for solving the vehicle routing problem","volume":"31","author":"Nazari","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref20","article-title":"Schedulenet: Learn to solve multi-agent scheduling problems with reinforcement learning","author":"Park","year":"2021"},{"key":"ref21","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"30","author":"Khalil","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3068828"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022672621406"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2024.3382533"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.15607\/rss.2023.xix.064"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-72933-1_11"},{"key":"ref27","article-title":"Implicit reparameterization gradients","volume":"31","author":"Figurnov","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.6.974"},{"key":"ref29","article-title":"ORTools routing options","author":"Perron","year":"2023"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100369"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2972894"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.01.020"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2019.11.003"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.21236\/ADA164453"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"issue":"9","key":"ref36","article-title":"Variance reduction techniques for gradient estimates in reinforcement learning","volume":"5","author":"Greensmith","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"ref37","article-title":"Back-propagation through the void: Optimizing control variates for black-box gradient estimation","author":"Grathwohl","year":"2017"},{"key":"ref38","article-title":"Interpolated policy gradient: Merging on-policy and off-policy gradient estimation for deep reinforcement learning","volume":"30","author":"Gu","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref39","first-page":"4061","article-title":"Taming MAML: Efficient unbiased meta-reinforcement learning","volume-title":"International Conference on Machine Learning","author":"Liu"},{"key":"ref40","first-page":"5132","article-title":"Scaffold: Stochastic controlled averaging for federated learning","volume-title":"International Conference on Machine Learning","author":"Karimireddy"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-018-9826-2"},{"key":"ref42","article-title":"Using large ensembles of control variates for variational inference","volume":"31","author":"Geffner","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref43","article-title":"Multi-source causal inference using control variates","author":"Guo","year":"2021"},{"key":"ref44","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"International Conference on Machine Learning","author":"Gilmer"},{"key":"ref45","volume-title":"Control techniques for complex networks","author":"Meyn","year":"2008"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3236629"}],"event":{"name":"2024 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","location":"Abu Dhabi, United Arab Emirates","start":{"date-parts":[[2024,10,14]]},"end":{"date-parts":[[2024,10,18]]}},"container-title":["2024 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10801246\/10801290\/10802039.pdf?arnumber=10802039","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T19:07:17Z","timestamp":1735240037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10802039\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,14]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/iros58592.2024.10802039","relation":{},"subject":[],"published":{"date-parts":[[2024,10,14]]}}}