  In this short paper, we study the capacity-constrained vehicle routing
problem (CVRP) and its solution by randomized Monte Carlo methods. For solving
CVRP we use some pseudorandom number generators commonly used in practice. We
use linear, multiple-recursive, inversive, and explicit inversive congruential
generators and obtain random numbers from each to provide a route for CVRP.
Then we compare the performance of pseudorandom number generators with respect
to the total time the random route takes. We also constructed an open-source
library github.com/iedmrc/binary-cws-mcs on solving CVRP by Monte-Carlo based
heuristic methods.
