本文提出了带容量约束的覆盖旅行商问题(Capacitated Covering Salesman Problem,CCSP),在带容量约束的车辆路径问题中引入了基于覆盖的服务理念。在CCSP中,给定车辆可途经的位置,其中部分位置存在有需求的客户。问题目标是由驻扎在一个车场的车队为客户提供服务,同时最小化车辆行驶的总距离。CCSP的独特之处在于,客户无需被车辆到访即可获得服务,只要处于车辆的覆盖范围内就能得到服务。这一假设的应用背景是部分客户无法抵达(例如禁止车辆进入)或逐一到访所有客户不切实际。\n本研究基于整数线性规划(Integer Linear Programming,ILP)和有偏随机密钥遗传算法(Biased Random-Key Genetic Algorithm,BRKGA)元启发式算法,提出了CCSP的优化方法。研究在CCSP基准算例集上开展了计算实验,从原始界的角度评估了这些方法的性能。此外,本文扩展了所提出的ILP公式,构建了一种新型混合整数线性规划(Mixed Integer Linear Programming,MILP)模型,用于求解多车场覆盖巡游车辆路径问题(Multi-Depot Covering Tour Vehicle Routing Problem,MDCTVRP)。计算实验表明,在最优性间隙方面,扩展后的MILP公式优于此前的最优精确方法,尤其针对多个此前未被求解的算例,得到了最优解。
英文摘要:
This paper introduces the Capacitated Covering Salesman Problem (CCSP), approaching the notion of service by coverage in capacitated vehicle routing problems. In CCSP, locations where vehicles can transit are provided, some of which have customers with demands. The objective is to service customers through a fleet of vehicles based in a depot, minimizing the total distance traversed by the vehicles. CCSP is unique in the sense that customers, to be serviced, do not need to be visited by a vehicle. Instead, they can be serviced if they are within a coverage area of the vehicle. This assumption is motivated by applications in which some customers are unreachable (e.g., forbidden access to vehicles) or visiting every customer is impractical. In this work, optimization methodologies are proposed for the CCSP based on ILP (Integer Linear Programming) and BRKGA (Biased Random-Key Genetic Algorithm) metaheuristic. Computational experiments conducted on a benchmark of instances for the CCSP evaluate the performance of the methodologies with respect to primal bounds. Furthermore, our ILP formulation is extended in order to create a novel MILP (Mixed Integer Linear Programming) for the Multi-Depot Covering Tour Vehicle Routing Problem (MDCTVRP). Computational experiments show that the extended MILP formulation outperformed the previous state-of-the-art exact approach with respect to optimality gaps. In particular, optimal solutions were obtained for several previously unsolved instances.
Diversity Optimization for Travelling Salesman Problem via Deep Reinforcement Learning
South China University of Technology(华南理工大学);Singapore Management University(新加坡管理大学);Massachusetts Institute of Technology(麻省理工学院);Eindhoven University of Technology(埃因霍温理工大学)
Solving the clustered traveling salesman problem with d-relaxed priority rule
University of Technology and Engineering, Vietnam National University(越南国立大学工程技术大学);Interuniversitary Research Centre on Entreprise Networks, Logistics and Transportation (CIRRELT)(企业网络、物流与运输校际研究中心(CIRRELT));Polytechnique Montréal(蒙特利尔理工学院)
A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drone
Suleyman Demirel University(苏莱曼·德米雷尔大学);UNIST(蔚山科学技术院);Korea University(高丽大学);Amazon(亚马逊);University of South Florida(南佛罗里达大学)
强化学习最近在许多组合最优化问题的学习质量解决方案中显示出了希望。特别是,基于注意力的编码器-解码器模型在各种路由问题上表现出很高的效率,包括流动推销员问题(TSP)。不幸的是,它们在TSP with Drone(TSP-D)中表现不佳,需要协调不同的车辆-卡车和无人机。在TSP-D中,两辆车一前一后地移动,并且可能需要在节点处等待另一辆车加入。基于注意力的无状态解码器无法在车辆之间进行这种协调。我们提出了一个混合模型,它使用注意编码器和长短期记忆(LSTM)网络解码器,其中解码器的隐藏状态可以表示所做的动作序列。我们的经验表明,这样的混合模型提高了一个纯粹的基于注意力的模型的解决方案的质量和计算效率。最小-最大容量限制车辆路径问题(mmCVRP)的实验结果也表明,混合模型比基于注意力的模型更适合于多车辆的协调路径问题。所提出的模型展示了与运筹学基线方法相当的结果。
A New Constructive Heuristic driven by Machine Learning for the Traveling Salesman Problem
Dalle Molle Institute for Artificial Intelligence(达尔莫尔人工智能研究所);Università della Svizzera Italiana(提契诺大学);University of Modena and Reggio Emilia(摩德纳和雷焦艾米利亚大学)
Machine Learning Constructives and Local Searches for the Travelling Salesman Problem
Università della Svizzera Italiana(瑞士意大利语区大学);Dalle Molle Institute for Artificial Intelligence(达莱莫勒人工智能研究所);University of Modena and Reggio Emilia(摩德纳-雷焦艾米利亚大学)
A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Drone
Université Catholique de Louvain(鲁汶大学);Hanoi University of Technology(河内理工大学);University of Engineering and Technology, Vietnam National University(越南国立大学工程技术大学)
DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem
School of Computer Science, Huazhong University of Science and Technology(华中科技大学计算机学院);School of Computing and Information Systems, Singapore Management University(新加坡管理大学计算与信息系统学院)
Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems
College of Computer Science and Technology, Jilin University(吉林大学计算机科学与技术学院);Nanyang Technological University(南洋理工大学);School of Computer Science and Engineering, Nanyang Technological University(南洋理工大学计算机科学与工程学院);School of Computer Science, University of Science & Technology of China(中国科学技术大学计算机学院);School of Mathematical and Computer Sciences, Heriot-Watt University(赫瑞瓦特大学数学与计算机科学学院);College of Computer, National University of Defense Technology(国防科技大学计算机学院)
VRPAgent: LLM-Driven Discovery of Heuristic Operators for Vehicle Routing Problems
Bielefeld University(比勒菲尔德大学);Radical Numerics;KAIST(韩国科学技术院);Peking University(北京大学);University of Turin(都灵大学);Stanford University(斯坦福大学);RIKEN(日本研究机构);Omelet;University of Vienna(维也纳大学)
G-LNS: Generative Large Neighborhood Search for LLM-Based Automatic Heuristic Design
Software College, Northeastern University(东北大学软件学院);International Centre for Theoretical Physics Asia-Pacific, University of Chinese Academy of Sciences(中国科学院大学国际理论物理亚太中心);Taiji Laboratory for Gravitational Wave Universe, University of Chinese Academy of Sciences(中国科学院大学太极引力波宇宙实验室);Tsinghua University(清华大学)
Towards Omni-generalizable Neural Methods for Vehicle Routing Problems
Nanyang Technological University(南洋理工大学);Eindhoven University of Technology(埃因霍温理工大学);Shandong University(山东大学);Singapore Management University(新加坡管理大学)