Comparison of Randomized Solutions for Constrained Vehicle Routing Problem

Demirci I. E., Ozdemir S. E., Yayla O.

2nd International Conference on Electrical, Communication and Computer Engineering, ICECCE 2020, İstanbul, Türkiye, 12 - 13 Haziran 2020 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası:
  • Doi Numarası: 10.1109/icecce49384.2020.9179407
  • Basıldığı Şehir: İstanbul
  • Basıldığı Ülke: Türkiye
  • Orta Doğu Teknik Üniversitesi Adresli: Hayır

Özet

© 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.