Click here to flash read.
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.
Click here to read this post out
ID: 129521; Unique Viewers: 0
Voters: 0
Latest Change: May 16, 2023, 7:31 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Comments:
Newcom