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 attempts to solve the famous Vehicle Routing Problem byconsidering multiple constraints including capacitated vehicles, single depot,and distance using two approaches namely, cluster first and route the secondalgorithm and using integer linear programming. A set of nodes are provided asinput to the system and a feasible route is generated as output, givingclusters of nodes and the route to be traveled within the cluster. Forclustering the nodes, we have adopted the DBSCAN algorithm, and the routing isdone using the approximation algorithm, Christofide's algorithm. The solutiongenerated can be employed for solving real-life situations, like deliverysystems consisting of various demand nodes.

Capacitated Vehicle Routing Problem Using Conventional and Approximation Method