CONFIGURABLE WEIGHTING OF REPRESENTATIONAL CONTROLS TO OBTAIN AN OPTIMAL ROUTING SOLUTION

• US 20020046073A1
• Filed: 09/22/1998
• Published: 04/18/2002
• Est. Priority Date: 05/29/1998
• Status: Abandoned Application

• Current Assignee: Epicron, Inc.
• Original Assignee: Epicron, Inc.
• Inventors: LANE, MARK T., POWELL, G. EDWARD, INDSETH, RUNAR
• Application Number:
  US09/158,309
• Publication Number:
  US 20020046073A1
• Time in Patent Office: Days
• US Class Current: 705/8
• CPC Class Codes: G06Q 10/047 Optimisation of routes or paths, e.g. travelling salesman problem
• CPC Class Codes: G06Q 30/0283 Price estimation or determination

Abstract

A method for delivering an optimal routing solution that considers the complete operational cost model in the optimization process is provided. The method utilizes heterogeneous service providers to service heterogeneous service points, where the service points are geographically dispersed. The method includes providing a plurality of service point profiles that define parameters associated with a plurality of service points; providing a plurality of service provider profiles, that define parameters associated with a plurality of service providers; providing a service point visit plan for the plurality of service points; and scoring a plurality of routing solutions to service the plurality of service points, utilizing the service point profiles and the service provider profiles. In addition, scoring controls are provided for assigning a cost to, or penalty, either linearly or non-linearly, selected parameters being either met or not met within any possible routing solution. The profiles, visit plan, and scoring controls are provided to a route engine that determines an optimal routing solution according to the scoring model.

Claims

1. A method for calculating an optimal routing solution given a plurality of service points and a plurality of service providers, the plurality of service providers having a plurality of parameters that are selectably weighted, the method comprising:

a) selecting at least one of the plurality of parameters to weight;

b) specifying a weight to be applied to the selected at least one of the plurality of parameters; and

c) scoring a plurality of routing solutions utilizing the specified weight applied to the at least one of the plurality of parameters.

2. A method for calculating an optimal routing solution given a plurality of service points and a heterogeneous plurality of service providers, the heterogeneous plurality of service providers having a plurality of parameters that are selectably weighted, the method comprising:

a) selecting at least one of the plurality of parameters to weight;

b) specifying a weight to be applied to the selected at least one of the plurality of parameters; and

c) scoring a plurality of routing solutions utilizing the specified weight applied to the at least one of the plurality of parameters.

3. The method for calculating an optimal routing solution, as recited in claim 2 wherein the plurality of parameters comprise:

i) a service provider'"'"'s start time; and

ii) a service provider'"'"'s end time.

4. The method for calculating an optimal routing solution, as recited in claim 3 wherein the weight that is applied to the selected at least one of the plurality of parameters controls a cost associated with a routing solution that falls outside of the service provider'"'"'s start time or end time.

5. The method for calculating an optimal routing solution, as recited in claim 2 wherein the weight that is applied to the selected at least one of the plurality of parameters is non-linear.

6. A method for scheduling routes using heterogeneous service providers to service heterogeneous service points, the service points being geographically dispersed, the service points having a plurality of service point profiles, and the service providers having a plurality of service provider profiles, the method comprising:

a) providing a service point visit plan for at least one of the plurality of service points;

b) specifying a configurable weight to be applied to a selectable parameter within one of the plurality of service provider profiles; and

c) scoring a plurality of routing solutions to service the at least one of the plurality of service points, utilizing the service point profiles, the service provider profiles, and the weighted selectable parameter;

d) wherein an optimal routing solution is obtained from the scored plurality of routing solutions.

7. The method for scheduling routes, as recited in claim 6 wherein the configurable weight is specified using a graphical user interface.

8. The method for scheduling routes, as recited in claim 6 wherein the configurable weight is specified by entering a textual non-linear equation.

9. The method for scheduling routes, as recited in claim 6 wherein the configurable weight allows a non-linear cost to be applied to a routing solution at variance with a service provider profile.

10. The method for scheduling routes, as recited in claim 7 wherein a variance from a service provider profile comprises:

i) scheduling a service provider to visit a service point outside the service provider'"'"'s designated work hours.

11. The method for scheduling routes, as recited in claim 8 wherein a variance from a service provider profile comprises:

i) scheduling a service provider to visit a service point, causing the service provider to work overtime.

12. The method for scheduling routes, as recited in claim 9 wherein a variance from a service provider profile comprises:

i) scheduling a service provider to visit a service point outside of the service provider'"'"'s desired work hours.

13. The method for scheduling routes, as recited in claim 6 further comprising:

e) specifying a second configurable weight to be applied to a selectable parameter within one of the plurality of service point profiles; and

f) scoring a plurality of routing solutions to service the at least one of the plurality of service points, utilizing the second configurable weight.

14. The method for scheduling routes, as recited in claim 11 wherein the second configurable weight allows a non-linear cost to be applied to a routing solution at variance with a service point profile.

15. The method for scheduling routes, as recited in claim 14 wherein a variance from a service point profile comprises:

i) scheduling a service provider to visit a service point outside of a service point time window specified in one of the plurality of service point profiles.

17. The method for scheduling routes, as recited in claim 16, wherein the weight that is assigned to selected parameters is non-linear.

18. The method for scheduling routes, as recited in claim 16, wherein the weight that is assigned to selected parameters is selectably linear or non-linear.

16. A method for scheduling routes using heterogeneous service providers to service heterogeneous service points, the service points being geographically dispersed, the method comprising:

a) providing a plurality of service point profiles, corresponding to a plurality of service points;

b) providing a plurality of service provider profiles, corresponding to a plurality of service providers;

c) providing a service point visit plan for at least one of the plurality of service points; and

d) scoring a plurality of routing solutions to service the at least one of the plurality of service points, utilizing the service point profiles and the service provider profiles, the scoring comprising;

(1) assigning a weight to selected parameters within the plurality of service point profiles and within the plurality of service provider profiles;

(2) utilizing a route engine to generate the plurality of routing solutions according to the service point visit plan; and

(3) scoring the plurality of routing solutions utilizing the weighted selected parameters.

e) wherein an optimal routing solution is obtained from the scored plurality of routing solutions.