We consider the Maximum-Profit Routing Problem (MPRP), a variant of pick-up routing problem introduced in \cite{Armaselu-arXiv-2016, Armaselu-PETRA}, in which the goal is to maximize total profit. The original MPRP restricts vehicles to visit a site at most once. In this paper, we consider extensions of MPRP, in which a site may be visited by a vehicle multiple times. Specifically, we consider two versions: one in which the quantity to be picked up at each site is constant in time (MPRP-M), and one with time-varying supplied quantities, which increase linearly in time (MPRP-VS). For each of these versions, we come up with a constant-factor polynomial-time approximaltion scheme.
翻译:我们考虑了最大利润路由问题(MPRP),这是在\cite{Armaslu-arXiv-2016,Armaslu-PETRA}中引入的搭载路线问题的一种变式,其目标是最大限度地实现总利润。最初的MPRP限制车辆最多一次访问一个站点。在本文中,我们考虑的是MPRP的扩展,其中车辆可以多次访问一个站点。具体地说,我们考虑的是两种版本:一种是每个站点所要接收的数量在时间上保持不变(MPRP-M),一种是时间变化供应量,在时间上线性上增加(MPRP-VS)。对于每一种版本,我们都会提出一个常量的多功能性多功能性适应性计划。