Method Apparatus, and System for Grouping Transportation Services

• US 20100017273A1
• Filed: 09/17/2009
• Published: 01/21/2010
• Est. Priority Date: 06/01/2001
• Status: Abandoned Application

• Current Assignee: Ariba Incorporated (SAP SE)
• Original Assignee: Ariba Incorporated (SAP SE)
• Inventors: Merchant, Christopher M., Rushin, Jason P., Damico, Douglas J., Hommrich, Thomas P.
• Application Number:
  US12/586,086
• Publication Number:
  US 20100017273A1
• Time in Patent Office: Days
• US Class Current: 705/10
• CPC Class Codes: G06Q 10/047 Optimisation of routes or paths, e.g. travelling salesman problem
• CPC Class Codes: G06Q 10/08 Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
• CPC Class Codes: G06Q 10/08355 Routing methods
• CPC Class Codes: G06Q 30/0283 Price estimation or determination
• CPC Class Codes: G06Q 30/06 Buying, selling or leasing transactions
• CPC Class Codes: G06Q 30/0601 Electronic shopping [e-shopping]
• CPC Class Codes: G06Q 40/04 Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Abstract

Grouping transportation lanes is disclosed. Transportation lanes include origination and destination location information, and also have associated values. The grouping includes creating an origination area, creating a destination area, compiling lanes into a lot, and making a determination with respect to the number of carriers available to operate in a lot area.

Claims

1. A system for grouping transportation lanes included in a plurality of transportation lanes, wherein each transportation lane in the plurality of transportation lanes includes an origination location and a destination location and each transportation lane in the plurality of transportation lanes has an associated transport value, comprising:

a processor; and

a memory coupled with the processor, wherein the memory is configured to provide the processor with instructions which when executed cause the processor to;

create an origination area;

create a destination area;

compile into a lot all lanes in the plurality of transportation lanes having origination locations falling within the origination area and destination locations falling within the destination area;

determine the number of carriers available to operate in a lot area comprising the origination area and the destination area; and

store the lot if it is determined that at least a predetermined number of carriers are available to operate in the lot area.

2. The system of claim 1 wherein the memory is further configured to provide the processor with instructions which when executed cause the processor to compile a list of carriers operating in the origination area and the destination area.

3. The system of claim 1, wherein the origination location is a facility.

4. The system of claim 1, wherein the origination location includes a zone defined by a US postal system code.

5. The system of claim 1, wherein the origination location includes at least one of a city, a state, and a nation.

6. The system of claim 1, wherein the origination location includes a predefined geographic area.

7. The system of claim 1, wherein the destination location is a facility.

8. The system of claim 1, wherein the destination location includes a zone defined by at least a portion of a US postal system code.

9. The system of claim 1, wherein the destination location includes at least one of a city, a state, and a nation.

10. The system of claim 1, wherein the destination location includes a predefined geographic area.

11. The system of claim 1 wherein the memory is further configured to provide the processor with instructions which when executed cause the processor to sort the lanes by a value of transportation in each lane.

12. The system of claim 1 wherein the memory is further configured to provide the processor with instructions which when executed cause the processor to store the lanes in a database.

13. The system of claim 1, wherein the lot is a first lot and wherein the memory is further configured to provide the processor with instructions which when executed cause the processor to remove each lane included in the first lot from a database of available transportation lanes to avoid placing lanes included in the first lot into a second lot.

14. The system of claim 1 wherein the memory is further configured to provide the processor with instructions which when executed cause the processor to create a plurality of lots, collectively including all lanes in the plurality of transportation lanes

15. The system of claim 1, wherein the transport value is an estimated cost of transporting goods in the lot.

16. The system of claim 1, wherein the transport value is a quantity of goods to be transported in the lot.

17. The system of claim 1, wherein the lot is created for use in an online auction.

18. The system of claim 1 further comprising redistributing the lanes within a plurality of other lots if it is determined that fewer than the predetermined number of carriers are available to operate in the lot area.

19. A method of grouping transportation lanes included in a plurality of transportation lanes, wherein each transportation lane in the plurality of transportation lanes includes an origination location and a destination location and each transportation lane in the plurality of transportation lanes has an associated transport value, comprising:

creating an origination area;

creating a destination area;

compiling into a lot all lanes in the plurality of transportation lanes having origination locations falling within the origination area and destination locations falling within the destination area;

determining with a processor the number of carriers available to operate in a lot area comprising the origination area and the destination area; and

storing the lot if it is determined that at least the predetermined number of carriers are available to operate in the lot area.

20. A computer program product for grouping transportation lanes included in a plurality of transportation lanes, wherein each transportation lane in the plurality of transportation lanes includes an origination location and a destination location and each transportation lane in the plurality of transportation lanes has an associated transport value, the computer program product being embodied in a computer readable medium and comprising computer instructions for:

creating an origination area;

creating a destination area;

compiling into a lot all lanes in the plurality of transportation lanes having origination locations falling within the origination area and destination locations falling within the destination area;

determining the number of carriers available to operate in a lot area comprising the origination area and the destination area; and

storing the lot if it is determined that at least the predetermined number of carriers are available to operate in the lot area.