Find routes
Find the quickest or shortest routes based on time and/or distance. Solve for two stop locations or create a sequence that puts multiple stops in the best order. Build these routes with live or historical traffic.
Find the quickest or shortest route with two or more stops. Take into account real-world constraints such as traffic feeds, U-turns, road barriers, incidents, maximum permitted vehicle height, and many more.
Given a set of work locations and a fleet of vehicles, determine what stops should be serviced by each route and in what sequence the stops should be visited. Minimize the overall operating cost for the entire fleet while considering real-world constraints.