Randomized Algorithm for the Maximum-Profit Routing Problem
share
In this paper, we consider the Maximum-Profit Routing Problem (MPRP), introduced in <cit.>. 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.
READ FULL TEXT