Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/37134
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Demirci, I.E. | - |
dc.contributor.author | Özdemir, Şaziye Ece | - |
dc.contributor.author | Yayla, O. | - |
dc.date.accessioned | 2021-02-02T09:24:09Z | |
dc.date.available | 2021-02-02T09:24:09Z | |
dc.date.issued | 2020 | - |
dc.identifier.isbn | 9781728171166 | - |
dc.identifier.uri | https://hdl.handle.net/11499/37134 | - |
dc.identifier.uri | https://doi.org/10.1109/ICECCE49384.2020.9179407 | - |
dc.description.abstract | 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. © 2020 IEEE. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | constrained vehicle routing problem | en_US |
dc.subject | Monte Carlo simulation | en_US |
dc.subject | pseudorandom number generators | en_US |
dc.subject | Monte Carlo methods | en_US |
dc.subject | Number theory | en_US |
dc.subject | Random number generation | en_US |
dc.subject | Vehicle routing | en_US |
dc.subject | Congruential generators | en_US |
dc.subject | Open-source libraries | en_US |
dc.subject | Pseudo random number generators | en_US |
dc.subject | Random Numbers | en_US |
dc.subject | Randomized solutions | en_US |
dc.subject | Vehicle Routing Problems | en_US |
dc.subject | Heuristic methods | en_US |
dc.title | Comparison of Randomized Solutions for Constrained Vehicle Routing Problem | en_US |
dc.type | Conference Object | en_US |
dc.authorid | 0000-0002-4709-2198 | - |
dc.identifier.doi | 10.1109/ICECCE49384.2020.9179407 | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopus | 2-s2.0-85091935719 | en_US |
local.message.claim | 2023-07-12T12:17:45.679+0300|||rp05508|||submit_approve|||dc_contributor_author|||None | * |
dc.owner | Pamukkale University | - |
item.grantfulltext | open | - |
item.fulltext | With Fulltext | - |
item.cerifentitytype | Publications | - |
item.openairetype | Conference Object | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
crisitem.author.dept | 17.04. Mathematics | - |
Appears in Collections: | Fen-Edebiyat Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection |
Files in This Item:
File | Size | Format | |
---|---|---|---|
Comparison_of_Randomized_Solutions_for_Constrained_Vehicle_Routing_Problem.pdf | 243.27 kB | Adobe PDF | View/Open |
CORE Recommender
SCOPUSTM
Citations
1
checked on Oct 13, 2024
Page view(s)
30
checked on Aug 24, 2024
Download(s)
14
checked on Aug 24, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.