Feasible Path finding for different transport modality using A-Star algorithm

Several applications are available to search a feasible path from one place to various destinations on a specific transportation media. They give solutions or recommendations only based on ideal conditions. Most of those methods do not calculate the overhead of traffic, current weather conditions and many other obstacles. Sometimes we may need different possible paths between two locations. Here we propose a method that uses information from all available locations and we calculate the optimal path from that location to desired location(s) and different possible paths between two locations .These methods use heuristics that are changing time to time.