The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems
Eindhoven University of Technology（埃因霍温理工大学）；Delft University of Technology（代尔夫特理工大学）；McGill University（麦吉尔大学）；Bielefeld University（比勒费尔德大学）；General Electric（通用电气）；Shopify（Shopify（电商平台））；Université de Montréal（蒙特利尔大学）；Polytechnic Institute of Viseu（维塞乌理工学院）；Rockets of Awesome（Rockets of Awesome（游戏公司））；TH Köln（科隆应用技术大学）；University of Málaga（马拉加大学）；Telecom Paris（巴黎电信学院（巴黎高等电信学院））
Laurens Bliek, Paulo da Costa, Reza Refaei Afshar, Yingqian Zhang, Tom Catshoek, Daniël Vos, Sicco Verwer, Fynn Schmitt-Ulms, André Hottung, Tapan Shah, Meinolf… 展开作者
Laurens Bliek, Paulo da Costa, Reza Refaei Afshar, Yingqian Zhang, Tom Catshoek, Daniël Vos, Sicco Verwer, Fynn Schmitt-Ulms, André Hottung, Tapan Shah, Meinolf Sellmann, Kevin Tierney, Carl Perreault-Lafleur, Caroline Leboeuf, Federico Bobbio, Justine Pepin, Warley Almeida Silva, Ricardo Gama, Hugo L. Fernandes, Martin Zaefferer, Manuel López-Ibáñez, Ekhine Irurozki
This paper reports on the first international competition on AI for the traveling salesman problem (TSP) at the International Joint Conference on Artificial Intelligence 2021 (IJCAI-21). The TSP is one of the classical combinatorial optimization problems, with many variants inspired by real-world applications. This first competition asked the participants to develop algorithms to solve a time-dependent orienteering problem with stochastic weights and time windows (TD-OPSWTW). It focused on two types of learning approaches: surrogate-based optimization and deep reinforcement learning. In this paper, we describe the problem, the setup of the competition, the winning methods, and give an overview of the results. The winning methods described in this work have advanced the state-of-the-art in using AI for stochastic routing problems. Overall, by organizing this competition we have introduced routing problems as an interesting problem setting for AI researchers. The simulator of the problem has been made open-source and can be used by other researchers as a benchmark for new AI methods.
Multi-Task Vehicle Routing Solver via Mixture of Specialized Experts under State-Decomposable MDP
The Hong Kong University of Science and Technology（香港科学与技术大学）；Singapore Management University（新加坡管理学院）；The Hong Kong University of Science and Technology (Guangzhou)（香港科学与技术大学（广州））；Tencent AI Lab（腾讯AI实验室）；University of Alberta（阿尔伯塔大学）；Shanghai Jiao Tong University（上海交通大学）
CompeteSMoE -- Statistically Guaranteed Mixture of Experts Training via Competition
FPT Software AI Center（FPT软件人工智能中心）；The University of Texas at Austin（德克萨斯大学奥斯汀分校）；Institute for Infocomm Research, A ∗ STAR（信息与通信研究 institute, A ∗ STAR）
Competitions in AI -- Robustly Ranking Solvers Using Statistical Resampling
University of British Columbia（不列颠哥伦比亚大学）；University of Huddersfield（哈德斯菲尔德大学）；RWTH Aachen University（亚琛工业大学）；Leiden University（莱顿大学）；University of Brescia（布雷西亚大学）
LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers
School of Future Technology, South China University of Technology（华南理工大学未来技术学院）；School of Computer Science and Engineering, South China University of Technology（华南理工大学计算机科学与工程学院）；School of Engineering and Computer Science, Victoria University of Wellington（惠灵顿维多利亚大学工程与计算机科学学院）；Institute of Marine Science and Technology, Shandong University（山东大学海洋科学与技术研究院）；School of Computing and Information Systems, Singapore Management University（新加坡管理大学计算与信息系统学院）
CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention
School of System Design；Intelligent Manufacturing Southern University of Science；Department of Computer Science City University of Hong Kong Hong Kong, China
Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives
Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, College of Computer Science and Technology, Jilin university（教育部符号计算与知识工程重点实验室、计算机科学与技术学院、吉林大学）；Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly（卓越老龄化主动生活联合研究中心）；School of Software, Tsinghua University（软件学院、清华大学）；College of Computing and Data Science, Nanyang Technological University（计算与数据科学学院、南洋理工大学）
MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts
College of Computing and Data Science, Nanyang Technological University（南洋理工大学计算与数据科学学院）；School of Computing and Information Systems, Singapore Management University（新加坡管理大学计算与信息系统学院）；Institute of Marine Science and Technology, Shandong University（山东大学海洋科学与技术研究院）；Singapore Institute of Manufacturing Technology (SIMTech), Agency for Science, Technology and Research (A*STAR)（新加坡科技研究局下属新加坡制造技术研究院）
Towards Efficient Constraint Handling in Neural Solvers for Routing Problems
Nanyang Technological University（南洋理工大学）；Singapore Management University（新加坡管理学院）；Shandong University（山东大学）；Eindhoven University of Technology（埃因霍温理工大学）；MIT（麻省理工学院）
Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer
National University of Singapore（新加坡国立大学）；University of Electronic Science and Technology of China（电子科技大学）；Institute for Infocomm Research, A*STAR（新加坡科技研究局资讯通信研究院）；The Hong Kong University of Science and Technology（香港科技大学）；Singapore Institute of Manufacturing Technology, A*STAR（新加坡科技研究局新加坡制造技术研究院）；Shandong University（山东大学）
SPACE: Unifying Symmetric and Asymmetric Routing Problems for Generalist Neural Solver
School of Automation and Intelligent Manufacturing, Southern University of Science and Technology, Shenzhen, China（自动化与智能制造学院，南方科技大学，深圳，中国）；Pengcheng Laboratory, Shenzhen, China（鹏城实验室，深圳，中国）；Guangdong Provincial Key Laboratory of Fully Actuated System Control Theory and Technology, Southern University of Science and Technology, Shenzhen, China（广东省全驱动系统控制理论与技术重点实验室，南方科技大学，深圳，中国）；College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China（计算机科学与软件工程学院，深圳大学，深圳，中国）
Rethinking Light Decoder-based Solvers for Vehicle Routing Problems
School of Computing and Information Systems, Singapore Management University（新加坡管理大学计算与信息系统学院）；College of Computing and Data Science, Nanyang Technological University（南洋理工大学计算与数据科学学院）
Partial Column Generation with Graph Neural Networks for Team Formation and Routing
School of Management, Department of Operations & Technology（管理学院、运营与技术系）；Technical University of Munich（慕尼黑技术大学）；Department of Information Systems（信息系统系）；Eindhoven University of Technology（埃因霍温理工大学）
Adversarial Generative Flow Network for Solving Vehicle Routing Problems
Singapore Management University（新加坡管理大学）；Singapore Institute of Manufacturing Technology (SIMTech), Agency of Science, Technology and Research (A*STAR)（新加坡制造技术研究院（新加坡科技研究局下属机构））
LMask: Learn to Solve Constrained Routing Problems with Lazy Masking
Beijing International Center for Mathematical Research, Peking University（北京大学北京国际数学研究中心）；Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院）；Department of Statistics and Data Science, University of Pennsylvania（宾夕法尼亚大学统计与数据科学系）
KAYROS: An Anytime and Exact Open-Source Solver for Duration-Minimization Time-Dependent Vehicle Routing. A Technical Report and a Case Study in Human-AI Engineering
