Visibility of stocks across multiple warehouses spread across geographies and then fulfillment using optimal route planning has always been a challenge within enterprises. ERP’s have provided solutions in and around these areas using complex planning and optimizing solutions.

Complex algorithms are used to compute optimal routes to be taken to perform stock fulfillment. If these business rules are not configured properly, the end users will always have a ‘cognitive dissonance’ on the outcome as rules get processed in a black box program understood by highly trained and competent resources.

What if new age technology were to provide a much simpler and intuitive way of performing this seemingly complex operation? Imagine visualizing the various warehouses on a map within a browser. The application allows a two way flexibility to visualize data.

In the first method the user can select a specific item and immediately the map refreshes to show the stocks in each of the warehouse. These stocks are shown in Red, Amber and Green so that use can clearly see where the stocks are deficient (Red) and where they are available in plenty (Green).  The SCM Planner can easily see the nearest warehouse(s) that can source a specific warehouse where the stock is deficient. The user simply drags and drops from the source to destination. This will pop up a window asking to enter the quantity to be transferred. IF the quantity to be transferred is more than the minimum re-order level then it will not allow so, else the stock can be transferred. Stocks can be transferred from multiple nearby locations. These will then kick-off a set of workflows at the target and destination so that the transactions get executed in the specified time.

In the second method, the user can click on any of the warehouses. This will immediately show all the products in the warehouse sorted by Red, Amber and Green. The user can select all the Red Items and transfer them to the planning panel. Then the steps indicated in the first method can be executed for each and every item.

Both of the above methods are very easily implemented using a combination of search and browser technologies.