{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:44:16Z","timestamp":1775328256400,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100004921","name":"Shanghai Municipal Science and Technology Major Project","doi-asserted-by":"publisher","award":["2021SHZDZX0102"],"award-info":[{"award-number":["2021SHZDZX0102"]}],"id":[{"id":"10.13039\/501100004921","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,18]]},"DOI":"10.1145\/3719545.3759088","type":"proceedings-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T09:38:41Z","timestamp":1758015521000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Looking Ahead to Avoid Being Late: Solving Hard-Constrained Traveling Salesman Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1758-4041","authenticated-orcid":false,"given":"Jingxiao","family":"Chen","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8655-2946","authenticated-orcid":false,"given":"Ziqin","family":"Gong","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7848-5863","authenticated-orcid":false,"given":"Lvda","family":"Chen","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5585-1746","authenticated-orcid":false,"given":"Minghuan","family":"Liu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4021-4228","authenticated-orcid":false,"given":"Jun","family":"Wang","sequence":"additional","affiliation":[{"name":"University College London, London, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0281-8271","authenticated-orcid":false,"given":"Yong","family":"Yu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0127-2425","authenticated-orcid":false,"given":"Weinan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2025,9,16]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"Majed\u00a0Ghazi Alharbi Ahmed Stohy Mohammed Elhenawy Mahmoud Masoud and Hamiden Abd El-Wahed Khalifa. 2021. Solving Traveling Salesman Problem with Time Windows Using Hybrid Pointer Networks with Time Features. Sustainability (2021).","DOI":"10.3390\/su132212906"},{"key":"e_1_3_3_1_3_2","unstructured":"David Applegate Ribert Bixby Vasek Chvatal and William Cook. 2006. Concorde TSP Solver. http:\/\/www.math.uwaterloo.ca\/tsp\/concorde. Accessed: 2023-05-18."},{"key":"e_1_3_3_1_4_2","unstructured":"Jimmy Ba Jamie\u00a0Ryan Kiros and Geoffrey\u00a0E. Hinton. 2016. Layer Normalization. ArXiv abs\/1607.06450 (2016)."},{"key":"e_1_3_3_1_5_2","unstructured":"Peter\u00a0W. Battaglia Jessica\u00a0B. Hamrick Victor Bapst Alvaro Sanchez-Gonzalez Vin\u00edcius\u00a0Flores Zambaldi Mateusz Malinowski Andrea Tacchetti David Raposo Adam Santoro Ryan Faulkner \u00c7aglar G\u00fcl\u00e7ehre H.\u00a0Francis Song Andrew\u00a0J. Ballard Justin Gilmer George\u00a0E. Dahl Ashish Vaswani Kelsey\u00a0R. Allen Charlie Nash Victoria Langston Chris Dyer Nicolas Manfred\u00a0Otto Heess Daan Wierstra Pushmeet Kohli Matthew\u00a0M. Botvinick Oriol Vinyals Yujia Li and Razvan Pascanu. 2018. Relational inductive biases deep learning and graph networks. ArXiv abs\/1806.01261 (2018)."},{"key":"e_1_3_3_1_6_2","unstructured":"Quentin Cappart Thierry Moisan Louis-Martin Rousseau Isabeau Pr\u2019emont-Schwarz and Andr\u00e9\u00a0Augusto Cir\u00e9. 2020. Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization. ArXiv abs\/2006.01610 (2020)."},{"key":"e_1_3_3_1_7_2","unstructured":"Jonas\u00a0K. Falkner and Lars Schmidt-Thieme. 2020. Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention. ArXiv abs\/2006.09100 (2020)."},{"key":"e_1_3_3_1_8_2","unstructured":"Zhang-Hua Fu Kai-Bin Qiu and Hongyuan Zha. 2020. Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances. ArXiv abs\/2012.10658 (2020)."},{"key":"e_1_3_3_1_9_2","unstructured":"Keld Helsgaun. 2017. An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems. Roskilde: Roskilde University 12 (2017)."},{"key":"e_1_3_3_1_10_2","unstructured":"Chaitanya\u00a0K. Joshi Thomas Laurent and Xavier Bresson. 2019. An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem. ArXiv abs\/1906.01227 (2019)."},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Kamil Kaminski Jan Ludwiczak Maciej Jasi\u0144ski Adriana Bukala Rafal Madaj Krzysztof Szczepaniak and Stanis\u0142aw Dunin-Horkawicz. 2021. Rossmann-toolbox: a deep learning-based protocol for the prediction and design of cofactor specificity in Rossmann fold proteins. Briefings in Bioinformatics 23 (2021).","DOI":"10.1093\/bib\/bbab371"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Imdat Kara and Tusan Derya. 2015. Formulations for Minimizing Tour Duration of the Traveling Salesman Problem with Time Windows. Procedia. Economics and finance 26 (2015) 1026\u20131034.","DOI":"10.1016\/S2212-5671(15)00926-0"},{"key":"e_1_3_3_1_13_2","unstructured":"Minsu Kim Junyoung Park and Jinkyoo Park. 2022. Sym-nco: Leveraging symmetricity for neural combinatorial optimization. Advances in Neural Information Processing Systems 35 (2022) 1936\u20131949."},{"key":"e_1_3_3_1_14_2","unstructured":"Thomas Kipf and Max Welling. 2016. Semi-Supervised Classification with Graph Convolutional Networks. ArXiv abs\/1609.02907 (2016)."},{"key":"e_1_3_3_1_15_2","volume-title":"International Conference on Learning Representations","author":"Kool Wouter","year":"2018","unstructured":"Wouter Kool, Herke van Hoof, and Max Welling. 2018. Attention, Learn to Solve Routing Problems!. In International Conference on Learning Representations."},{"key":"e_1_3_3_1_16_2","unstructured":"Yeong-Dae Kwon Jinho Choo Byoungjip Kim Iljoo Yoon Youngjune Gwon and Seungjai Min. 2020. Pomo: Policy optimization with multiple optima for reinforcement learning. Advances in Neural Information Processing Systems 33 (2020) 21188\u201321198."},{"key":"e_1_3_3_1_17_2","volume-title":"International Conference on Learning Representations","author":"Loshchilov Ilya","year":"2017","unstructured":"Ilya Loshchilov and Frank Hutter. 2017. Decoupled Weight Decay Regularization. In International Conference on Learning Representations."},{"key":"e_1_3_3_1_18_2","unstructured":"Qiang Ma Suwen Ge Danyang He Darshan\u00a0D. Thaker and Iddo Drori. 2019. Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning. ArXiv abs\/1911.04936 (2019)."},{"key":"e_1_3_3_1_19_2","unstructured":"Alex\u00a0W. Nowak Soledad Villar Afonso\u00a0S. Bandeira and Joan Bruna. 2017. A Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks. ArXiv abs\/1706.07450 (2017)."},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"crossref","unstructured":"Christos Papalitsas Konstantinos Giannakis Theodore Andronikos Dimitrios Theotokis and Angelo Sifaleras. 2015. Initialization methods for the TSP with Time Windows using Variable Neighborhood Search. 2015 6th International Conference on Information Intelligence Systems and Applications (IISA) (2015) 1\u20136.","DOI":"10.1109\/IISA.2015.7388106"},{"key":"e_1_3_3_1_21_2","volume-title":"International Conference on Machine Learning","author":"Parisotto Emilio","year":"2019","unstructured":"Emilio Parisotto, H.\u00a0Francis Song, Jack\u00a0W. Rae, Razvan Pascanu, \u00c7aglar G\u00fcl\u00e7ehre, Siddhant\u00a0M. Jayakumar, Max Jaderberg, Raphael\u00a0Lopez Kaufman, Aidan Clark, Seb Noury, Matthew\u00a0M. Botvinick, Nicolas Manfred\u00a0Otto Heess, and Raia Hadsell. 2019. Stabilizing Transformers for Reinforcement Learning. In International Conference on Machine Learning."},{"key":"e_1_3_3_1_22_2","unstructured":"Laurent Perron and Vincent Furnon. 2011. OR-Tools. https:\/\/developers.google.com\/optimization\/. Accessed: 2023-05-18."},{"key":"e_1_3_3_1_23_2","unstructured":"Qiaoyue Tang Yangzhe Kong Lemeng Pan and Choonmeng Lee. 2022. Learning to Solve Soft-Constrained Vehicle Routing Problems with Lagrangian Relaxation. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2207.09860 (2022)."},{"key":"e_1_3_3_1_24_2","volume-title":"NIPS","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam\u00a0M. Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan\u00a0N. Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017. Attention is All you Need. In NIPS."},{"key":"e_1_3_3_1_25_2","unstructured":"Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio\u2019 and Yoshua Bengio. 2017. Graph Attention Networks. ArXiv abs\/1710.10903 (2017)."},{"key":"e_1_3_3_1_26_2","volume-title":"NIPS","author":"Vinyals Oriol","year":"2015","unstructured":"Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. 2015. Pointer Networks. In NIPS."},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Zhihao Xing and Shikui Tu. 2020. A Graph Neural Network Assisted Monte Carlo Tree Search Approach to Traveling Salesman Problem. IEEE Access 8 (2020) 108418\u2013108428.","DOI":"10.1109\/ACCESS.2020.3000236"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"crossref","unstructured":"Rongkai Zhang Anatolii Prokhorchuk and Justin Dauwels. 2020. Deep Reinforcement Learning for Traveling Salesman Problem with Time Windows and Rejections. 2020 International Joint Conference on Neural Networks (IJCNN) (2020) 1\u20138.","DOI":"10.1109\/IJCNN48605.2020.9207026"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"crossref","unstructured":"Jiongzhi Zheng Kun He Jianrong Zhou Yan Jin and Chumin Li. 2022. Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems. Knowl. Based Syst. 260 (2022) 110144.","DOI":"10.1016\/j.knosys.2022.110144"}],"event":{"name":"DAI '24: 6th International Conference on Distributed Artificial Intelligences","location":"Singapore Singapore","acronym":"DAI '24"},"container-title":["Proceedings of the 2024 Sixth International Conference on Distributed Artificial Intelligences"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719545.3759088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T13:13:36Z","timestamp":1758114816000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719545.3759088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,18]]},"references-count":28,"alternative-id":["10.1145\/3719545.3759088","10.1145\/3719545"],"URL":"https:\/\/doi.org\/10.1145\/3719545.3759088","relation":{},"subject":[],"published":{"date-parts":[[2024,12,18]]},"assertion":[{"value":"2025-09-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}