In this paper, we consider the Maximum-Profit Routing Problem (MPRP), introduced in \cite{Armaselu-PETRA}. In MPRP, the goal is to route the given fleet of vehicles to pickup goods from specified sites in such a way as to maximize the profit, i.e., total quantity collected minus travelling costs. Although deterministic approximation algorithms are known for the problem, currently there is no randomized algorithm. In this paper, we propose the first randomized algorithm for MPRP.

翻译：本文考虑最大化利润路径问题（Maximum-Profit Routing Problem, MPRP），该问题由文献 \cite{Armaselu-PETRA} 提出。在MPRP中，目标是规划给定车队路径，从指定站点收集货物以最大化利润，即总收集量减去运输成本。尽管该问题已有确定性近似算法，但目前尚缺乏随机化算法。本文提出了首个针对MPRP的随机化算法。