论文标题
比较被约束车辆路由问题的随机解决方案
Comparison of Randomized Solutions for Constrained Vehicle Routing Problem
论文作者
论文摘要
在这篇简短的论文中，我们通过随机的蒙特卡洛方法研究了容量受限的车辆路由问题及其解决方案。为了求解CVRP，我们使用了一些通常在实践中使用的伪数字生成器。我们使用线性，多回收，反相和显式的一致性发电机，并从每个生成器中获取随机数，以提供CVRP的途径。然后，我们比较了伪数字生成器相对于随机路线所需的总时间的性能。我们还构建了一个开源库github.com/iedmrc/binary-cws-mcs，以基于蒙特 - 卡洛的启发式方法解决CVRP。
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.
