English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper introduces a new approach to improve the performance of theCapacitated Vehicle Routing Problem with Time Windows (CVRPTW) solvers for ahigh number of nodes. It proposes to cluster nodes together usingRecursive-DBSCAN - an algorithm that recursively applies DBSCAN until clustersbelow the preset maximum number of nodes are obtained. That approach leads to61% decrease in runtimes of the CVRPTW solver as benchmarked against GoogleOptimization Tools, while the difference of total distance and number ofvehicles used by found solutions is below 7%. The improvement of runtimes withthe Recursive-DBSCAN method is because of splitting the node-set intoconstituent clusters, which limits the number of solutions checked by thesolver, consequently reducing the runtime. The proposed method consumes lessmemory and is able to find solutions for problems up to 5000 nodes, while thebaseline Google Optimisation Tools solves problems up to 2000 nodes.

Solving High Volume Capacitated Vehicle Routing Problem with Time Windows using Recursive-DBSCAN clustering algorithm