arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.06995cs.AI
收藏

带容量约束的覆盖旅行商问题的精确算法与启发式方法

Exact algorithms and heuristics for capacitated covering salesman problems

Institute of Computing(计算机学院);Universidade Estadual de Campinas(坎皮纳斯州立大学)

Lucas Porto Maziero, Fábio Luiz Usberti, Celso Cavellucci

AI总结:

本文提出带容量约束的覆盖旅行商问题,设计了基于ILP和BRKGA的优化方法,还扩展得到求解多车场覆盖巡游车辆路径问题的新型MILP,性能优于现有精确方法并解出多个此前未解决的算例。

摘要:

本文提出了带容量约束的覆盖旅行商问题(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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑