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 discusses a graph based route solving algorithm to find theoptimal path for an electric vehicle picking the best charging locations amongthousands to minimize the total cumulative driving distance between the endpoints of the trip. To this end, we have devised a combinatorial optimizationalgorithm and a fixed storage graph topology construction for the graph roadnetwork of the continental USA. We have also re-purposed our existing Dijkstrasolver to reduce the computational cost of many shortest path solves involvedin the algorithm. An adaptive and light weight spatial search structure is alsodevised for finding a set of prospective stations at each charging locationusing uniform bins and double link associations. The entire algorithm isimplemented as yet another multi-threaded at-scale graph solver within thesuite of Kinetica-Graph analytics, exposed as a restful API endpoint andoperable within SQL. Several example trips are solved and the results aredemonstrated within the context.

Optimal routing algorithm for trips involving thousands of ev-charging stations using Kinetica-Graph