Random Sequences in Vehicle Routing Problem

Date

2023-01-01

Author

Gülşen, Mehmet Emin
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

12
views

0
downloads

Cite This

In this paper, we study the Capacitated Vehicle Routing Problem (CVRP) and implemented a simulation-based algorithm with different random number generators. The Binary-CWS-MCS algorithm has been integrated with six different random number generators and their variations. The random number generators used in this study gathered with respect to two perspectives, the first is to compare the mostly known and used RNGs in simulation-based studies which are Linear Congruential Generator (LCG) and its shift variant, Multiple Recursive Generator (MRG) and its shift variant and the second perspective is based on the improvements in the random number generator algorithms which are Mersenne Twister Pseudo Random Generator (MT) and Permuted Congruential Generator (PCG). The results of experiments showed that the PCG and MT pseudo random generators can generate better results than the other random number generators.

URI

http://dx.doi.org/10.1007/978-3-031-32412-3_32
https://hdl.handle.net/11511/108121

Collections

Graduate School of Applied Mathematics, Article