SYSTEMS AND METHODS ALLOCATING ITEMS AMONG AUCTION SITES TO MAXIMIZE PROFIT

• US 20130006801A1
• Filed: 08/15/2012
• Published: 01/03/2013
• Est. Priority Date: 03/15/2011
• Status: Abandoned Application

• Current Assignee: Opera Solutions U.S.A., Llc
• Original Assignee: Opera Solutions, LLC.
• Inventors: Spoelstra, Jacob, Solari, Soren, Zhao, Qi
• Application Number:
  US13/586,504
• Publication Number:
  US 20130006801A1
• Time in Patent Office: Days
• US Class Current: 705/26.3
• CPC Class Codes: G06Q 30/08 Auctions
• CPC Class Codes: G06Q 40/04 Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Abstract

A method for allocating vehicles to auction sites. An inventory database stores information uniquely identifying a plurality of items and associating each of the items with one of a plurality of available auction sites. Constraints relating to the movement of the items are stored in a constraints database. Items are identified which are available to be moved from a current location to one of the auction sites. A profit value is estimated for each available move. A move is identified for one item having a highest estimated profit above an identified threshold and meeting related constraints. This move is selected, and profits are reestimated for remaining items to be moved. The selection steps are repeated until no remaining available moves are feasible according to the threshold and constraints. Once all feasible moves have been selected, information associated with the items and moves is transmitted to a client device.

Claims

1. A computer-implemented method for allocating items to be sold at auction among a plurality of auction sites, the method performed on a server computer and comprising steps of:

a. providing an inventory database storing information uniquely identifying a plurality of items and associating each of said items with a one of the plurality of available auction sites or a holding site as a current location;

b. providing a constraints database storing a first set of allocation constraints;

c. identifying for each of said items one or more of said available auction sites to which said item is available to be moved from its current location;

d. determining for each of said items an estimated profit value to be realized from each available move;

e. selecting an available move for one of said items that has a highest estimated profit value above a threshold value among available moves that are feasible under the set of allocation constraints;

f. re-estimating the estimated profit value for the remaining available moves of other ones of said items;

g. repeating steps e. and f. while the available moves for the other ones of said items have an estimated profit value above the threshold value and are feasible under the first set of allocation constraints;

h. allocating each of said items having a selected move to its associated location among the plurality of available auction sites and the holding site ; and

i. transmitting the identification information for each item having a selected move together with information identifying its associated allocated location to a client device.

2. The computer-implemented method of claim 1, wherein the items comprise vehicles.

3. The computer-implemented method of claim 2, wherein the vehicles comprise automobiles.

4. The computer-implemented method of claim 1, wherein the items comprise industrial equipment.

5. The computer-implemented method of claim 1, further comprising the step of storing the identification information for each item and its associated location in an allocation database.

6. The computer-implemented method of claim 1, wherein the step of determining an estimated profit value from an available move further comprises the steps of:

estimating a sales price for one of said items at its current location;

estimating a sales price for said item at the auction site of the available move;

estimating a shipping cost for moving said item from its current location to the auction site of the available move; and

calculating the estimated profit value as the estimated sales price at the auction site of the available move less the estimated sales price at the current location and the estimated cost of moving said item from the current location to the auction site of the available move.

7. The computer-implemented method of claim 6, wherein the shipping cost is estimated as a function of a shipping distance for the available move and at least one of a size or weight of said item.

8. The computer-implemented method of claim 1, wherein the step of estimating a sales price of an item at an auction site further comprises the steps of:

estimating an expected sales date for the item; and

estimating the sales price as a function of the sales date.

9. The computer-implemented method of claim 8, wherein the expected sales date is determined as a function of a waiting time estimated as a function of the number of items at the auction site and an expected shipping time from the current location to the auction site of the available move.

10. The computer-implemented method of claim 8, wherein the sales price is adjusted as a function of estimated depreciation.

11. The computer-implemented method of claim 10, wherein depreciation is estimated as a function of an estimated cost of capital.

12. The computer-implemented method of claim 8, wherein the sales price is adjusted as a function of a seasonality function.

13. The computer-implemented method of claim 8, wherein the sales price is adjusted as a function of price elasticity.

14. The computer-implemented method of claim 1, wherein the first set of allocation constraints specifies a maximum allowable number of items for each of the available auction sites.

15. The computer-implemented method of claim 14, further comprising the step of:

storing a second set of constraints in the constraints database;

determining whether the selected moves of steps e.-g. are feasible under the second set of constraints; and

repeating steps e.-g. while ones of said items have available moves having an estimated profit value above the threshold value until the selected moves are feasible under the second set of constraints.

16. The computer-implemented method of claim 15, wherein the second set of allocation constraints specifies a minimum allowable number of items for each of the available auction sites.

17. A computer program product, comprising a non-transitory computer-usable storage medium having computer-readable instructions embodied therein, the computer-readable instructions adapted to be executed by a server to implement a method for allocating items to be sold at auction among auction sites comprising the steps of:

a. storing information uniquely identifying a plurality of items in an inventory database, and associating each of said items with a current of a plurality of available auction sites or a holding site as a current location;

b. storing a first set of allocation constraints in a constraints database ;

c. identifying for each of said items one or more of said available auction sites to which said item is available to be moved from its current location;

d. determining for each of said items an estimated profit value to be realized from each available move;

e. selecting an available move for one of said items that have a highest estimated profit value above a threshold value among available moves that are feasible under the set of allocation constraints;

f. re-estimating the estimated profit value for the remaining available moves of other ones of said items;

g. repeating steps e. and f. while the available moves for the other ones of said items have an estimated profit value above the threshold value and are feasible under the first set of allocation constraints;

h. allocating each of said items having a selected move to its associated location among the plurality of available auction sites and the holding site ; and

i. transmitting the identification information for each item having a selected move together with information identifying its associated allocated location over a secure link to a client device.

18. The computer program product of claim 17, wherein the items comprise vehicles.

19. The computer program product of claim 18, wherein the vehicles comprise automobiles.

20. The computer program product of claim 17, wherein the items comprise industrial equipment.

21. The computer program product of claim 17, further comprising instructions for implementing the step of storing the identification information for each item and the allocated auction site in an allocation database.

22. The computer program product of claim 17, wherein the step of determining an estimated profit value from an available move further comprises the steps of

estimating a sales price for one of said items at its current location;

estimating a sales price said item at the auction site of the available move;

estimating a shipping cost for moving said item to from the current location to the auction site of the available move; and

calculating the estimated profit value as the estimated sales price at the auction site of the available move less the estimated sales price at the current location and the estimated cost of moving said item from the current location to the auction site of the available move.

23. The computer program product of claim 22, wherein the shipping cost is estimated as a function of a shipping distance for the available move and at least one of a size or weight of said item.

24. The computer program product of claim 17, wherein the step of estimating a sales price of an item at an auction location further comprises the steps of:

estimating an expected sales date for the item; and

estimating the sales price as a function of the sales date.

25. The computer program product of claim 24, wherein the expected sales date is determined as a function of a waiting time estimated as a function of the number of items at the auction site and an expected shipping time from the original location to the auction site of the available move.

26. The computer program product of claim 24, wherein the sales price is adjusted as a function of estimated depreciation.

27. The computer-implemented method of claim 17, wherein the first set of allocation constraints specifies a maximum allowable number of items for each of the available auction sites.

28. The computer-implemented method of claim 27, further comprising the step of:

storing a second set of constraints in the constraints database;

determining whether the selected moves of steps e.-g. are feasible under the second set of constraints; and

repeating steps e.-g. while ones of said items have available moves having an estimated profit value above the threshold value until the selected moves are feasible under the second set of constraints.

29. The computer-implemented method of claim 28, wherein the second set of allocation constraints specifies a minimum allowable number of items for each of the available auction sites.

30. A computer-implemented method for allocating one or more items to be sold at auction to one or more auction sites, the method comprising:

storing information uniquely identifying the one or more items associated with the one or more auction sites;

storing a first set of constraints;

determining estimated profits obtained by moving the one or more items among the one or more auction sites, subject to the constraints;

selecting ones of the moves for ones of the one or more items having a highest estimated profit value above a threshold value;

allocating the one or more items among the one or more auction sites according to the selected moves; and

transmitting information uniquely identifying the one or more items and the allocated auction sites to a client device.

31. The method of claim 30, wherein the determining step comprises the steps of:

estimating an origin sales price for the one or more items at the one or more auction sites;

estimating a destination sales price for the one or more items at the one or more auction sites different than used in estimating the origin sales price;

estimating a shipping cost for the one or more items in moving the items from one location to another locations; and

determining the estimated profit as a function of the origin sales price, the destination sales price and shipping cost.

32. The method of claim 30, wherein the destination sales price is determined as a function of an initial price, a depreciation factor and a seasonability factor.

33. The method of claim 30, wherein the destination sales price is also determined as a function of a price elasticity.