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

带利润的车辆路径问题隐式顾客选择的大邻域算法

Large neighborhoods with implicit customer selection for vehicle routing problems with profits

Thibaut Vidal, Nelson Maculan, Puca Huachi Vaz Penna, Luis Satoru Ochi

摘要:

我们考虑几个车辆路径问题(VRP)的利润,寻求选择一个子集的客户,每一个都与利润,并设计服务行程。当在距离约束下利润之和最大化时,通常称之为团队定向运动问题。有能力限制的利润旅游问题寻求在能力限制下最大化利润减去旅行费用。最后,在具有私人车队和公共承运人的VRP中,一些客户可以被委托给外部承运人,但需要支付一定的费用。必须采取三种组合决策:客户选择,车辆分配和每条路线的交付顺序。我们提出了一个新的邻域搜索这些问题,探讨了一个指数的解决方案在伪多项式时间。搜索是进行与标准的VRP社区上的一个“详尽”的解决方案表示,访问所有客户。由于访问所有客户通常是不可行的或次优的,一个有效的“选择”算法,基于资源约束的最短路径,重复使用任何新的路线,以找到最佳的子序列访问客户。通过局部搜索、迭代局部搜索和混合遗传算法的大量计算实验证明了这些邻域结构的良好性能。有趣的是,即使是对这个邻域的第一个局部最优值的局部改进方法,在经典的团队定向基准测试实例中也达到了0.09%的平均差距,可以与当前最先进的元分析相媲美。与更标准的路由邻居杂交的有前途的研究途径也是开放的。

英文摘要:

We consider several Vehicle Routing Problems (VRP) with profits, which seek to select a subset of customers, each one being associated with a profit, and to design service itineraries. When the sum of profits is maximized under distance constraints, the problem is usually called team orienteering problem. The capacitated profitable tour problem seeks to maximize profits minus travel costs under capacity constraints. Finally, in the VRP with private fleet and common carrier, some customers can be delegated to an external carrier subject to a cost. Three families of combined decisions must be taken: customers selection, assignment to vehicles, and sequencing of deliveries for each route. We propose a new neighborhood search for these problems which explores an exponential number of solutions in pseudo polynomial time. The search is conducted with standard VRP neighborhoods on an "exhaustive" solution representation, visiting all customers. Since visiting all customers is usually infeasible or sub-optimal, an efficient "Select" algorithm, based on resource constrained shortest paths, is repeatedly used on any new route to find the optimal subsequence of visits to customers. The good performance of these neighborhood structures is demonstrated by extensive computational experiments with a local search, an iterated local search and a hybrid genetic algorithm. Intriguingly, even a local-improvement method to the first local optimum of this neighborhood achieves an average gap of 0.09% on classic team orienteering benchmark instances, rivaling with the current state-of-the-art metaheuristics. Promising research avenues on hybridizations with more standard routing neighborhoods are also open.

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

↑