Multicore data downscaling and routing visualization systems and related methods

1 . A method of visualizing a flow of a commodity in a supply chain route, the method comprising:

generating geographic area centroid coordinate data using a geographic area centroid module, a starting point, and an endpoint in response to receiving a selection of a geographic area by a user and storing the geographic area centroid coordinate data in a centroid database;

generating infrastructure polyline shapefile data and storing the infrastructure polyline shapefile data in a shapefile database;

generating a shortest path route using a shortest path module wherein a shortest path is generated using the geographic area centroid coordinate data and the infrastructure polyline shapefile data;

storing the shortest path route in a route database;

using a destination geographic area to select commodity data and route data from a commodity flow database for merging and storing in a merged route database;

determining from the merged route database a route corresponding with a unique route segment and storing each unique route segment between the starting point and the end point in a database of unique route segments;

for each of the unique route segments stored in the database of unique route segments, generating weighted route data and storing the weighted route data in a weighted route database; and

generating a visualization of the shortest path route using the weighted route data in the weighted route database.

2 . The method of claim 1 , wherein generating weighted route data and storing the weighted route data in a weighted route database further comprises:

using a looping process to generate and store weighted commodity data associated with a unique route in a weighted route database for the commodity by:

selecting each unique route segment;

querying the commodity data and the route data associated with the unique route segment from the merged route data database;

performing a sum of a flow of the commodity over the unique segment to form weighted route data for the unique segment; and

storing the weighted route data for the unique segment in the weighted route database.

3 . The method of claim 1 , wherein the shortest path module uses Dijikstra's routing algorithm to determine the shortest path route.

4 . The method of claim 1 , wherein selection of a commodity is received from a user.

5 . The method of claim 1 , wherein the visualization indicates a quantity of flow of the commodity by a width of a flow line on the visualization passing across a geographic area.

6 . A system for visualizing a flow of a commodity in a supply chain route, the system comprising:

using one or more multicore processors configured using computer readable instructions comprised in computer readable media to:

use a geographic area centroid module, generate geographic area centroid coordinate data from a starting point and an endpoint in response to receiving a selection of a geographic area by a user and storing the geographic area centroid coordinate data in a centroid database;

generate infrastructure polyline shapefile data and store the infrastructure polyline shapefile data in a shapefile database;

use a shortest path module, generate a shortest path route wherein the shortest path route is generated using the geographic area centroid coordinate data and the infrastructure polyline shapefile data;

store the shortest path route in a route database;

use a destination geographic area to select commodity data and route data from a commodity flow database for merging and storing in a merged route database;

determine from the merged route database a route corresponding with a unique route segment and storing each unique route segment between the starting point and the end point in a database of unique route segments;

for each of the unique route segments stored in the database of unique route segments, generating weighted route data and storing the weighted route data in a weighted route database; and

generate a visualization of the shortest path route using the weighted route data in the weighted route database.

7 . The system of claim 6 , wherein generating weighted route data and storing the weighted route data in a weighted route database further comprises wherein the one or more multicore processors are configured to:

use a looping process to generate and store weighted commodity data associated with a unique route in a weighted route database for the commodity by:

selecting each unique route segment;

querying the commodity data and the route data associated with the unique route segment from the merged route data database;

performing a sum of a flow of the commodity over the unique segment to form weighted route data for the unique segment; and

storing the weighted route data for the unique segment in the weighted route database.

8 . The system of claim 6 , wherein the shortest path module uses Dijikstra's routing algorithm to determine the shortest path route.

9 . The system of claim 6 , wherein selection of a commodity is received from a user.

10 . The system of claim 6 , wherein the visualization indicates a quantity of flow of the commodity by a width of a flow line on the visualization passing across a geographic area.

11 . A method of visualizing a flow of a commodity in a supply chain route, the method comprising:

receiving a selection of a geographic area by a user using a computer interface and determining a starting point and an endpoint and retrieving geographic area centroid coordinate data from a centroid database;

retrieving infrastructure polyline shapefile data from a shapefile database;

generating a shortest path route using a shortest path module wherein a shortest path is generated using the geographic area centroid coordinate data and the infrastructure polyline shapefile data;

storing the shortest path route in a route database;

using a destination geographic area to select commodity data and route data from a commodity flow database for merging and storing in a merged route database;

determining from the merged route database a route corresponding with a unique route segment and storing each unique route segment between the starting point and the end point in a database of unique route segments;

for each of the unique route segments stored in the database of unique route segments, assigning each unique route segment to a core comprised in a multi-core processor and generating weighted route data using the core;

storing the weighted route data in a weighted route database; and

generating a visualization of the shortest path route using the weighted route data in the weighted route database.

12 . The method of claim 11 , wherein generating weighted route data and storing the weighted route data in a weighted route database further comprises:

using a looping process to generate and store weighted commodity data associated with a unique route in a weighted route database for the commodity by:

selecting each unique route segment and assigning the core comprised in the multi-core processor;

using the core:

querying the commodity data and the route data associated with the unique route segment from the merged route data database;

performing a sum of a flow of the commodity over the unique segment to form weighted route data for the unique segment; and

storing the weighted route data for the unique segment in the weighted route database.

13 . The method of claim 11 , wherein the shortest path module uses Dijikstra's routing algorithm to determine the shortest path route.

14 . The method of claim 11 , wherein selection of a commodity is received from a user.

15 . The method of claim 11 , wherein the visualization indicates a quantity of flow of the commodity by a width of a flow line on the visualization passing across a geographic area.