取送货问题的渐近最优算法及其在大规模运输系统中的应用
Asymptotically Optimal Algorithms for Pickup and Delivery Problems with Application to Large-Scale Transportation Systems
AI总结:
针对NP难的堆垛机问题,提出一种渐近最优算法,其计算复杂度为O(n^{2+ε}),并刻画了最优路径长度的渐近特性;对于动态版本,推导了稳定车辆路径策略存在的充要条件。
摘要:
堆垛机问题(SCP)是NP难的,已知最佳近似算法仅提供9/5的近似比。本文的目标有三。首先,通过将问题嵌入随机框架,我们提出了一种新颖的SCP算法,该算法:(i) 渐近最优,即当取货/送货数量趋于无穷时,几乎必然产生接近最优的解;(ii) 计算复杂度为$O(n^{2+\eps})$,其中$n$是取货/送货对的数量,$\eps$是任意小的正常数。其次,我们渐近刻画了最优SCP路径的长度。最后,我们研究了SCP的动态版本,其中取货和送货请求按照泊松过程到达,该版本作为大规模需求响应运输(DRT)系统的模型。对于这种动态SCP,我们推导了稳定车辆路径策略存在的充要条件,该条件仅取决于工作空间几何、取货和送货点的随机分布、请求到达率以及车辆数量。我们的结果利用了欧几里得二分匹配问题与随机置换理论之间的新颖联系,并且在动态设置中展示了传统空间分布式排队系统中不存在的特征。
英文摘要:
The Stacker Crane Problem is NP-Hard and the best known approximation algorithm only provides a 9/5 approximation ratio. The objective of this paper is threefold. First, by embedding the problem within a stochastic framework, we present a novel algorithm for the SCP that: (i) is asymptotically optimal, i.e., it produces, almost surely, a solution approaching the optimal one as the number of pickups/deliveries goes to infinity; and (ii) has computational complexity $O(n^{2+\eps})$, where $n$ is the number of pickup/delivery pairs and $\eps$ is an arbitrarily small positive constant. Second, we asymptotically characterize the length of the optimal SCP tour. Finally, we study a dynamic version of the SCP, whereby pickup and delivery requests arrive according to a Poisson process, and which serves as a model for large-scale demand-responsive transport (DRT) systems. For such a dynamic counterpart of the SCP, we derive a necessary and sufficient condition for the existence of stable vehicle routing policies, which depends only on the workspace geometry, the stochastic distributions of pickup and delivery points, the arrival rate of requests, and the number of vehicles. Our results leverage a novel connection between the Euclidean Bipartite Matching Problem and the theory of random permutations, and, for the dynamic setting, exhibit novel features that are absent in traditional spatially-distributed queueing systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。