The present invention relates to data processing systems and methods for managing product financing and more specifically to a data processing system and method for evaluating maintenance costs of products.
Generally, products such as automobiles have been financed through a personal loan system, whereby the purchaser makes a down payment, takes title to the product and pays the loan balance in monthly payments which amortize the full amount of the loan. More recently, leasing arrangements have been introduced whereby the lessee makes monthly rental payments, returning the product to the lessor at the end of a predetermined term specified in the lease. Title to the product remains in the lessor. It is sometime specified in the lease that the lessee may at his option purchase the product for a stated value when the lease expires. The conditions of the lease may also include charges, e.g. a charge for abnormal mileage or wear and tear for lease of an automobile.
U.S. Pat. No. 4,736,294 discloses data processing methods and apparatus for managing vehicle financing. The data processing system provides information to assist in granting a loan, and determining at the time of making the loan a residual value of the vehicle at a predetermined option date.
Considering vehicle leases, at the signing of the lease, the lessee chooses a vehicle and states how many years he intends to keep it and the approximate mileage he intends to cover. Generally speaking, the lease duration is normally between 1 to 4 years while the number of miles varies from 20,000 to 60,000. Depending upon the vehicle and lease duration and mileage, the lessor determines monthly rental payments at the time of making the lease by estimating the resale value factor at the end of the lease, also referred to as the residual value factor, and costs due to the benefit margin, insurance and maintenance. Without taking into account the margin of the lessor, insurance, maintenance, etc., for sake of clarity, the sum of monthly rental payments corresponds to the difference between the sticker price, i.e. the purchasing price of the automobile as proposed by the manufacturer, and the resale price. If the resale price at the end of the lease is less than the estimation done at the time of making the lease, monthly rental payments have been underestimated and, as a consequence, the lessor loses money. Reciprocally, if the resale price at the end of the lease is more than the estimation done at the time of making the lease, monthly rental payments are overestimated, and thus the leases are not attractive. During the lease, the lessee may modify it to adapt its duration or mileage if the lessor agrees. In such a case, the residual value has to be reevaluated to adjust monthly rental payments accordingly.
In parallel with product loan, rental or purchase, maintenance agreements are often proposed. Such contracts are particularly suitable for leases since they reduce the lessee's care and provide a known and constant quality of service that increase residual value factor estimation accuracy. Thus, by adjusting the product value at the end of the lease, the lessor can purpose attractive leases without increasing commercial risks. By making a regular payment, e.g. a monthly payment, the lessee can effectively budget for the servicing and repair of the leased product since the lessor takes preventive and repair maintenance to his charge, e.g. overhauling of motor cars as advised by manufacturers.
Maintenance costs depend both on the product characteristics and maintenance agreement conditions, e.g. lease duration and mileage for vehicle leases. However, due to the general complexity of the products that are subjects of the maintenance agreements and the duration of the maintenance agreement, e.g. several years, the maintenance costs are difficult to model, and thus are generally evaluated approximately and experimentally by specialists.
Thus, it is an object of the invention to provide a method to learn the maintenance cost behavior of products according to their characteristics and maintenance agreement conditions.
It is a further object of the invention to provide a method to evaluate accurately the maintenance costs of products according to their characteristics and maintenance agreement conditions.
The accomplishment of these and other related objects is achieved by a method of learning the behavior of the maintenance costs of products, using a learning database containing product characteristics, maintenance agreement conditions and maintenance costs associated therewith. The method comprises the steps of:
The invention also includes a method to determine the maintenance cost of a product from its characteristics and maintenance agreement conditions, wherein a learning phase has been performed according to the previous method, comprising the steps of:
Further advantages of the present invention will become apparent to those skilled in the art upon examination of the drawings and detailed description. It is intended that any additional advantages be incorporated herein.
The method of the invention comprises a learning phase and an application phase. During the learning phase, the system analyses initial data to determine the behavior of the maintenance costs regarding characteristics of the products and maintenance agreement conditions. This analysis performed on known data allows, during the application phase, evaluation of the maintenance costs of products that have not been used to train the system, e.g. leases for which real maintenance costs are unknown, or leases for which real maintenance costs are known and that are used to test system accuracy.
For sake of illustration, the following description is based on leases of vehicles. However, the method of the invention may be used for any kind of maintenance agreement for any kind of product. In the detailed example, the maintenance cost that must be evaluated is expressed in cents per mile. Using the global maintenance cost does not change the method of the invention.
Then, a first learning step includes selecting a first product characteristic or combination of characteristics, referred to as first variable, e.g. vehicle brand and model, and determining a first maintenance cost estimation C0 for each value that can be reached by this first variable, i.e. for each of its modalities. The result of this determination, based upon table 100A records, is stored in table 210, (step 205). In this example, each row of table 210 contains a particular vehicle brand/model and the corresponding first maintenance cost evaluation C0. Since the choice of product and maintenance agreement conditions often depends upon product use, maintenance agreement conditions may depend upon product characteristics. Thus, it may be desirable to take these conditions into account. To that end, first maintenance cost evaluation may be normalized so as not to depend upon maintenance agreement conditions. An example of normalization will be detailed by reference to
Then, a second variable corresponding to another product characteristic or combination of characteristics may be selected and used to determine a correction coefficient α0 to improve maintenance cost estimation (step 215-0). Modalities of this second variable and associated correction coefficients α0 are memorized in table 220-0. Improved maintenance cost estimation C1 depends upon the first maintenance cost estimation C0 and the correction coefficient α0, and is obtained by multiplying C0 and α0. Likewise, a third or more variables may be selected to determine new correction coefficients α1, . . . , αn to improve successively maintenance cost estimations C1, . . . , (step 215-1, . . . 215-n). Modalities of these variables and associated correction coefficients are memorized in table 220-1, . . . 220-n. Finally, maintenance agreement conditions are used to determine a last correction coefficient αle to improve the last maintenance cost estimation (step 225). In this example, correction coefficient αle depends upon lease duration and mileage. Table 230 is used to memorized values of correction coefficient αle corresponding to specific lease duration/mileage pairs. The first, second, . . . , variables are chosen by specialists of maintenance cost estimation of the considered products and/or experimentally.
Steps 205, 215-0 and 225 are detailed in the following description by reference to
b illustrates the algorithm used to compute a first maintenance cost estimation C0(i) for each modality mod1(i) of the first variable. A first step consists in setting index i to zero (step 320). Index i characterizes the different modalities of the first variable, and maxi is the number of modalities. Then, values D1(i), D2(i), M1(i) and M2(i) are determined (step 325). In the described example, values D1(i) and D2(i) are determined so that 50% of the lease duration of the vehicles having common modality mod1(i) are included between D1(i) and D2(i), 25% are less than D1(i) and 25% are greater than D2(i). Values M1(i) and M2(i) are determined similarly. Maintenance cost estimations CA(i), CB(i), CC(i) and CD(i) of points A(i), B(i), C(i), and D(i) respectively are then computed (step 330). A window is defined around each of them to select points 305 that are used for this estimation. For example, considering point D(i), window 315 is defined according to ΔD1(i)−, ΔD1(i)+, ΔM1(i)− and ΔM1(i)+. These values may be constant, e.g. ΔD1(i)−=0.15 years, or evaluated like D1(i), D2(i), M1(i) and M2(i) using statistical point distribution.
After having selected all the points 305 that are included in window 315, the median value of the maintenance cost as given in column 145 of
where,
Maintenance cost C0(i) is memorized in table 210. Then, translation parameter τ(i) is evaluated according to the following equation (step 340):
and a normalized maintenance cost C′real according to Dref and Mref is computed for each modality mod1(i) according to the following relation (step 345):
Creal′(i)=Creal(i).τ(i) (3)
where Creal(i) is the real maintenance cost as given in column 145 of
Index i is incremented by one (step 350) and a test is performed to detect whether or not index i has reached its maximum value maxi (step 355). If index i has not reached maxi, the last seven steps are repeated (steps 325 to 355), else, if i has reached maxi, the process is stopped.
When the algorithm described on
where {tilde over (C)}(k) is the estimation of the maintenance cost for record k having modality modv(j), for example:
Then index k is incremented by one (step 415) and a test is performed to detect whether or not k has reached its maximum value maxk, i.e. whether v(k) has been computed for all the records of table 100A corresponding to modality modv(j), (step 420). If k has not reached maxk, the last three steps (steps 410 to 420) are repeated; else, if k has reached maxk, the median value of V is evaluated (step 425) to determine the correction coefficient αm corresponding to modality modv(j).
The correction coefficient αm is memorized in table 220-m with its associated modality. For example, considering the second variable, correction coefficient α0 is memorized in table 220-0 with associated modality while considering a third variable, correction coefficient α1 is memorized in table 220-1 with its associated modality. Then, index k is set to zero, index j is incremented by one (step 430) and a test is performed to detect whether or not j has reached its maximum value maxj, i.e. whether all the modalities modv have been analyzed, (step 435). If j has not reached maxj, the last seven steps (steps 405 to 435) are repeated; else, if j has reached maxj, the process is stopped. At the end of the process, a correction coefficient αm has been assigned to each modality modv of the selected variable and memorized in table 220-m with associated modality.
As an illustration, let us consider the following example: learning table 100A contains 100 records and table 230 has 3 columns and 3 rows that represent values D1, D2, D3 and M1, M2, M3 respectively. Thus, the values of D1, D2 and D3 must be chosen so that the lease duration of 25 vehicles is included between D1 and D2 and 25 between D2 and D3. Likewise, the values of M1, M2 and M3 are chosen so that the lease mileage of 25 vehicles is included between M1 and M2 and 25 between M2 and M3.
The correction coefficient αle of each table 230 cell is evaluated as illustrated in
c illustrates the main steps of the algorithm used to evaluate table 230 cells. After ΔD and ΔM parameters are set to define the size of window 515 (step 525), i and j indexes representing both the indices of table 230 cells and points 510 are set to zero (step 530). Points 505 surrounding the one defined with indexes i and j that are included in window 515 are selected, e.g. points 505_αle(3,4), (step 535) and the median value of the correction coefficients associated with these selected points is evaluated and memorized in table 230 cell defined with indexes i and j (step 540). D(i) and M(j) represent the lease duration and mileage, respectively, of table 230 cell defined by indexes i and j. Index i is incremented (step 545) and a test is performed to detect whether or not index i has reached its maximum value, i.e. the number of table 230 columns (step 550). If index i has not reached its maximum value, the last four steps (steps 535 to 550) are repeated. If index i has reached its maximum value, it is set to zero and index j is incremented (step 555) and a test is performed to detect whether or not index j has reached its maximum value, i.e. the number of table 230 rows (step 560). If index j has not reached its maximum value, the last six steps (steps 535 to 560) are repeated. If index j has reached its maximum value, the process is stopped, i.e. the correction coefficient αle of each table 230 cell has been evaluated.
where maxi and maxj are the number of table 230 columns and rows respectively. It is to be noted that step 720 needs to be executed only once. After the lease duration (D) and mileage (M) have been inputted, variables i−, i+, j− and j+ are evaluated (step 722). Variable i− corresponds to the maximum table 230 abscissa that corresponds to the greatest table 230 lease duration that is less than the input lease duration, i+ corresponds to the minimum table 230 abscissa that corresponds to the least table 230 lease duration that is greater than the inputted lease duration, j− corresponds to the maximum table 230 ordinate that corresponds to the greatest table 230 lease mileage that is less than the inputted lease mileage, and j+ corresponds to the minimum table 230 ordinate that corresponds to the least table 230 lease mileage that is greater than inputted lease mileage. For example, considering point B on
A first test is performed to detect whether or not i− is equal to zero (step 724). If i− is equal to zero, i′− and i′+ indexes are set to i+ and (i+)+1 respectively (step 726). If i− is not equal to zero, a second test is performed to detect whether or not i+ is equal to maxi+1 (step 728). If i+ is equal to maxi+1, i′− and i′+, indexes are set to (i−)−1 and i− respectively (step 730); else if i− is not equal to zero and i+ is not equal to maxi+1, i′− and i′+ indexes are set to i− and i+ respectively (step 732). Then, a test is performed to detect if j− is equal to zero or not (step 734). If j− is equal to zero, j′− and j′+ indexes are set to j+ and (j+)+1 respectively (step 736). If j− is not equal to zero another test is performed to detect whether or not j+ is equal to maxj+1 (step 738). If j+ is equal to maxj+1, j′− and j′+ indexes are set to (j−)−1 and j− respectively (step 740). If j− is not equal to zero and j+ is not equal to maxj+1, j′− and j′+ indexes are set to j− and j+ respectively (step 742). At the end of steps 724 to 742, a value has been assigned to i′−, i′+, j′− and j′+ indexes whatever the value of i−, i+, j− and j+ is. For example considering points A and B as shown on
A: i−=1, i+=2, j−=1, j+=2i′−=1, i′+=2, j′−=1, j′+=2
B: i−=4, i+=5, j−=0, j+=1i′−=4, i′+=5, j′−=1, j′+=2
Then, tests corresponding to steps 724, 728, 734 and 738 are performed again and provisional correction coefficient αle are estimated.
If i− is equal to zero (step 744), provisional correction coefficients αle′(i′−, j′−), αle′(i′+, j′−) , αle′(i′−, j′+) and αle′(i′+, j′+) are estimated according to the following equations (step 746):
a′le(i′−,j′−)=ale(i′−,j′−) (9-1)
a′le(i′+,j′−)=ale(i′−,j′−)+
a′le(i′−,j′+)=ale(i′−,j′+) (11-1)
a′le(i′+,j′+)=ale(i′−,j′+)+
where αle(D,M) is the correction coefficient of the lease duration D and mileage M.
If i+ is equal to maxi+1 (step 748), provisional correction coefficients αle′(i′−, j′−) , αle′(i′+, j′−), αle′(i′−,j′+) and αle′(i′+, j′+) are estimated according to the following equations (step 750):
a′le(i′−,j′−)=ale(i′+,j′−)−
a′le(i′+,j′−)=ale(i′+,j′−) (10-2)
a′le(i′−,j′+)=ale(i′+,j′+)−
a′le(i′+,j′+)=ale(i′+,j′+) (12-2)
If i− is not equal to zero and i+ is not equal to maxi+1, provisional correction coefficients αle′(i′−,j′−) , αle′(i′+,j′−), αle′(i′−, j′+) and αle′(i′+, j′+) are estimated according to the following equations (step 752):
a′le(i′−,j′−)=ale(i′−,j′−) (9-3)
a′le(i′+,j′−)=ale(i′+,j′−) (10-3)
a′le(i′−,j′+)=ale(i′−,j′+) (11-3)
a′le(i′+,j′+)=ale(i′+,j′+) (12-3)
If j− is equal to zero (step 754), provisional correction coefficients αle″(i′−,j′−), αle″(i′+,j′−), αle″(i′−,j′+) and αle″(i′+,j′+) are estimated according to the following equations (step 756):
a″le(i′−,j′−)=a′le(i′−,j′−) (13-1)
a″le(i′+,j′−)=a′le(i′+,j′−) (14-1)
a″le(i′−,j′+)=a′le(i′−,j′−)+
a″le(i′+,j′+)=a′le(i′+,j′−)+
If j+ is equal to maxj+1 (step 758), provisional correction coefficients αle″(i′−,j′−), αle″(i′+,j′−) , αle″(i′−,j′+) and αle″(i′+,j′+) are estimated according to the following equations (step 760):
a″le(i′−,j′−)=a′le(i′−,j′+)−
a″le(i′+,j′−)=a′le(i′+,j′+)−
a″le(i′−,j′+)=a′le(i′−,j′+) (15-2)
a″le(i′+,j′+)=a′le(i′+,j′+) (16-2)
If j− is not equal to zero and j+ is not equal to maxj+1, provisional correction coefficient αle″(i′−,j′−), αle″(i′+,j′−), αle″(i′−,j′+) and αle″(i′+,j′+) are estimated according to the following equations (step 762):
a″le(i′−,j′−)=a′le(i′−,j′−) (13-3)
a″le(i′+,j′−)=a′le(i′+,j′−) (14-3)
a″le(i′−,j′+)=a′le(i′−,j′+) (15-3)
a″le(i′+,j′+)=a′le(i′+,j′+) (16-3)
Then, residual value factor is computed according to the following equation (step 764):
where,
For example, considering point A and B as shown on
with,
a″le(1, 1)=ale(1, 1)
a″le(2, 1)=ale(2, 1)
a″le(1, 2)=ale(1, 2)
a″le(2, 2)=ale(2, 2)
with,
a″le(4, 1)=ale(4, 1)
a″le(5, 1)=ale(5, 1)
a″le(4, 2)=ale(4, 1)+
a″le(5, 2)=ale(5, 1)+
While the invention has been described in term of preferred embodiments, those skilled in the art will recognize that the invention can be practiced differently without departing from the spirit and scope of the invention as defined by the appended claims. In particular, vehicles may be classified according to criteria such as their category or utilization type, e.g. Touring/LCVs/gasoline/diesel, in order to create as many tables 210, 220-i and 230 as vehicle classes to improve system accuracy. In such cases, one learning phase is performed per class. Likewise, 2-dimensional table 230 may be replaced by an n-dimensional table (n being an integer) and the learning database 100 may be replaced by several learning databases, e.g. the first one being used to create tables 210 and 220-i, i.e. first learning step, and the second one being used to determine relevant maintenance agreement conditions and the associated correction coefficients, i.e. second learning step.
Number | Date | Country | Kind |
---|---|---|---|
1480081 | Aug 2001 | EP | regional |
Number | Name | Date | Kind |
---|---|---|---|
3617716 | Schulz | Nov 1971 | A |
4736294 | Gill et al. | Apr 1988 | A |
5504674 | Chen et al. | Apr 1996 | A |
5710915 | McElhiney | Jan 1998 | A |
6433872 | Nishi et al. | Aug 2002 | B1 |
6438270 | Harrington | Aug 2002 | B1 |
6502080 | Eichorst et al. | Dec 2002 | B1 |
6611816 | Lebda et al. | Aug 2003 | B2 |
6643608 | Hershey et al. | Nov 2003 | B1 |
6785805 | House et al. | Aug 2004 | B1 |
6842753 | Chaudhuri et al. | Jan 2005 | B2 |
7003487 | Skirpa | Feb 2006 | B1 |
20010032109 | Gonyea et al. | Oct 2001 | A1 |
20020069216 | Bates | Jun 2002 | A1 |
20020107780 | Suzuki et al. | Aug 2002 | A1 |
20020107789 | Wood | Aug 2002 | A1 |
20030105728 | Yano et al. | Jun 2003 | A1 |
20060085325 | Jammal et al. | Apr 2006 | A1 |
20070265907 | Adduci et al. | Nov 2007 | A1 |
Number | Date | Country | |
---|---|---|---|
20030055766 A1 | Mar 2003 | US |