Introduction

Traditionally routing has focused on finding the shortest paths in networks with positive, static edge costs representing the distance between two nodes. Energy-optimal routing for electric vehicles creates novel algorithmic challenges, as simply understanding edge costs as energy values and applying standard algorithms does not work. The reason for this is that electric vehicle (EV) reachable distance can vary based on such aspects as a number of passengers, speed, outside temperature or even route incline that influences recuperation. But even taking in mind all these parameters will not allow creating best routes. The reason for this is that in Lithuania EV owners have the privilege to use public transportation lanes for faster movement.

The most popular navigating applications use regular traffic data to create routes for users. Such routes become useless if we take in mind that EV owners can use much faster public transportation lanes while regular lanes have increased vehicular queuing.

We build a database-level system, wrapped by easy-to-use web API, that has all features of greatest route planning tools, but considers EVs priveledges, strong and weak sides, and creates the fastest as well as the most efficient routes for their owners in Vilnius city.

The system is developed by me and Linas Sabaliauskas, supervised by Linas Bukauskas during first semester of Problem-Based Project course of Information Technology study programme of Vilnius University. The system is free to use for non-commercial purposes.

How it works

We strongly recommend reading full documentation to have a whole image of how system operates. However, we have the best intentions to save your time, so here is the short story.

In this version we use Postgres, PostGIS and PgRouting in our database side system. Shortest path are gathered using Dijkstra’s algorithm and road specific data with applied advantages of electric vehicles. Every egde cost is calculated using formula:

cost = ((cost in seconds) x (simulated traffic load multiplier)) x (elevation multiplier) x (prioritization multiplier)

Where: 
• Cost in seconds is time during which edge can be passed. Calculated by dividing the length by maximum allowed speed.
• Simulated traffic load multiplier is multiplier which is created when traffic data is simulated. Currently simulates 200-270% traffic load. If the direction of movement is the same as direction of public trasportation lane on the edge, this edges multiplier is conscidered as 1, so it remains with 0% traffic load.
• Elevation multiplier is multiplier which is created when difference between edge start and end point elevation is evaluated.
• Prioritization multiplier is multiplier which helps to create paths prioritizing main roads, roads with higher amount of lanes.

How to test it out

You can test the system by following 4 easy steps.

Step 1: Find two points

You will need WGS84 coordinates of routes start and end point. To get them, visit espg.io and grab longitude and latitude of both: start and end point. Note, that for now, we have only Vilnius city roads in the database, so if you choose point out of the city bounds if will be mapped to closest existing road.

Step 2: Make a request

Use any request sender you like. The request method is GET, so you can even use your browser.Get the coordinates that you grabbed earlier in Step 1  and put them into request separating by comma. Here are some examples:

http://api.kono.lt:8888/api/path/25.256195,54.729775,25.283690,54.681663
http://api.kono.lt:8888/api/path/25.256195,54.729775,25.283690,54.681663/charging=1000

In the second example you are also searching for charging stations within 1000 meters radius starting from route end point.

Step 3: Copy path_geojson

In the response body, find and copy json object body called “path_geojson”. It may start like this:

{“type”:”FeatureCollection”,”features”:[{“type”:”Feature”,”properties”:{“id”:-101.0},”geometry”:{“type”:”LineString” … *rest of things in here* }

Step 4: Visualize

To do this, visit geojson.io. Clear the input box and paste the geojson that you have copied in Step 3 into it. Voila!

Ask for more with API Request

Insertion fields are marked with “{}” symbols.
Request method: GET
Request endpoint: api.kono.lt:8888/api/path/

Required attribute:
{startPointLongitude},{startPointLatitude},{endPointLongitude},{endPointLatitude}

Where:
• startPointLongitude is WGS 84 longitude coordinate of start point of route
• startPointLatitude is WGS 84 latitude coordinate of start point of route
• endPointLongitude is WGS 84 longitude coordinate of end point of route
• endPointLatitude is WGS 84 latitude coordinate of end point of route

Optional attributes:
• traffic={yes/no} declares whether to use traffic while creating path. Default is “yes”
• geojson={yes/no} declares whether add geojson to response or not. Default is “yes”
• charging={integer radius in meters} radius in which DB will look for charging stations. Charging stations search is not used by default.

Request examples:

http://api.kono.lt:8888/api/path/25.194139,54.702333,25.261914,54.700827

http://api.kono.lt:8888/api/path/25.194139,54.702333,25.261914,54.700827/charging=1000

http://api.kono.lt:8888/api/path/25.194139,54.702333,25.261914,54.700827/charging=1000/geojson=no

http://api.kono.lt:8888/api/path/25.194139,54.702333,25.261914,54.700827/traffic=no/charging=10

Receive more with API Response

Response body: