Title: Applying Markov Decision Process for obtaining the optimized route for transportation.

Problem Statement: Suppose there is a driver who wants to transport some purchased item to a customer

from source location A $($shop$)$ to destination location B $($customer house$).$ There are a number of routes

available for transporting an item from location A to location B$.$ While delivering the item, there are

certain challenges the driver has to look after such as transportation time, cost and traffic. The objective of

the problem is to find the optimal route for the driver by overcoming all the three parameters mentioned

above.

Scenario: Let's say the driver has his own navigation system and he can optimize his route using the

following different scenarios:

Optimize the route with respect to time: The driver has to find a route in such a way that the total

time taken to transport from A to B should be minimum irrespective of cost and traffic.

Optimize the route with respect to cost: In this scenario, the driver can find the optimal route by

minimizing the cost of transportation irrespective of time and traffic.

Optimize the route with respect to traffic: The third way of finding the optimal route is with

respect to minimum traffic irrespective of time and cost.

Optimize the route with respect to all challenges: In this scenario, the driver can find the best

optimal route by minimizing all the three challenges such as time, cost and with low traffic.