The vehicle routing problem is an optimisation problem with a high computational complexity that can be solved using heuristics methods to achieve near-optimal solutions in a reasonable amount of time. The work done in this study aims to compare the execution time and distance of different routing engines when using VROOM, as well as evaluate different implementations of the k-means algorithm by looking at the rand- and adjusted rand index. The results show a difference in the distance and execution time depending on which routing engine is used and it is unclear if there is a difference in the k-means implementations. Investigating the cause behind the observed results would be interesting in future works.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:his-24041 |
| Date | January 2024 |
| Creators | Arneson, Sebastian, Borgenstierna, Mattias |
| Publisher | Högskolan i Skövde, Institutionen för informationsteknologi |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0019 seconds