Random Sequences in Vehicle Routing Problem

Gülen M. E., Yayla O.

10th International Conference on Numerical Methods and Applications, NMA 2022, Borovets, Bulgaristan, 22 - 26 Ağustos 2022, cilt.13858 LNCS, ss.159-170 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 13858 LNCS
  • Doi Numarası: 10.1007/978-3-031-32412-3_14
  • Basıldığı Şehir: Borovets
  • Basıldığı Ülke: Bulgaristan
  • Sayfa Sayıları: ss.159-170
  • Anahtar Kelimeler: Capacitated vehicle routing problem, Monte-Carlo simulation, Random number generators
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.