Fletcher Yoder PC
Systems and methods for comprehensive routing
In accordance with the present approach, a routing algorithm may be implemented to enable an agent to receive an acceptable route between a number of assigned tasks on demand. Particularly, the algorithm may determine the acceptable route by determining a travel cost for each route between an end location and one of the assigned tasks. Then, the algorithm may add in another assigned task and determine a travel cost for each route from the end location, to a first assigned task, and then to a second assigned task. Continuing in this manner, the algorithm constructs routes from the end location and through each possible subset of the assigned tasks, while tracking a permutation of each subset having the lowest travel cost. The algorithm may therefore trace back through the lowest-cost permutations to construct a complete route that has the lowest cost.
ServiceNow, Inc.
G G G G
G06Q G01C G06Q G01C
inventional inventional inventional inventional
Devinder Audrey Yachun Xianfa Wenhua Venkitesh
Narang Chen Deng Li Subramanian