Comparison of Randomized Solutions for Constrained Vehicle Routing Problem

Date

2020-06-01

Author

Demirci, Ibrahim Ethem
Ozdemir, Saziye Ece
Yayla, Oğuz

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

49
views

0
downloads

Cite This

© 2020 IEEE.In this short paper, we study 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.

URI

https://hdl.handle.net/11511/69851

Collections

Graduate School of Applied Mathematics, Conference / Seminar