engleski

On Distributed Solving of the Capacitated Vehicle Routing Problem with Branch-and-Cut Algorithms

In this paper, we describe theoretical and implementation issues concerning solving the capacitated vehicle routing problem with branch-and-cut algorithms. A distributed solver for the capacitated vehicle routing problem has been implemented within the branch-and-cut framework SYMPHONY. We present results obtained during experimental evaluation of the solver on a cluster of computers and analyze its scalability.

vehicle routing problem; branch-and-cut; distributed computing; experimental evaluation

nije evidentirano