Method and apparatus for transportation planning based on mission-specific vehicle capacity constraints

• US 8,626,540 B2
• Filed: 05/23/2005
• Issued: 01/07/2014
• Est. Priority Date: 05/23/2005
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Peterkofsky, Roy I., Budaraju, Hema, Yang, Mei, Sun, Rongming
• Primary Examiner(s): Jarrett, Scott L
• Assistant Examiner(s): CHOY, PAN G
• Application Number:
  US11/136,045
• Publication Number:
  US 20060265234A1
• Time in Patent Office: 3,151 Days
• Field of Search: 705/7.11, 705/7.12
• US Class Current: 705/7.11
• CPC Class Codes: G06Q 10/063 Operations research, analysis or management
• CPC Class Codes: G06Q 10/0631 Resource planning, allocation, distributing or scheduling for enterprises or organisations
• CPC Class Codes: G06Q 10/08 Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
• CPC Class Codes: G06Q 10/083 Shipping
• CPC Class Codes: G06Q 10/08355 Routing methods

Abstract

A computer, for planning moves of freight using vehicles, determines one or more attributes of a mission, based on a group of shipments being consolidated into the mission, computes a total amount of freight to be moved, and decides on feasibility of performing the mission, using a vehicle of a given type based at least on each of (A) the amount of freight, (B) one or more attributes of the mission, and (C) multiple effective capacities of freight moveable by the type of vehicle being selected, which depend on the mission attribute(s). Multiple effective capacities for each vehicle type, and corresponding values of mission attribute(s) at which they are to be applied are stored in the computer ahead of time, based on industry experience. Examples of mission attribute(s) include (1) number of stops, (2) type of stops (whether pooling or not), and (3) a combination thereof.

Claims

1. A computer-implemented method of planning movement of freight using vehicles, the computer-implemented method comprising:

automatically determining unloading/loading complexity of a mission in terms of a mission type, by using a first formula or a first table or a first logic based on a number of pooling stops and a number of non-pooling stops of the mission;

wherein each stop is to be made in executing a plurality of orders for movement of freight to be delivered by a vehicle of a specific size performing the mission;

automatically determining one effective vehicle capacity among multiple effective vehicle capacities of the vehicle, by using a second formula or a second table or a second logic that provides different values for different complexity missions, the second formula or the second table or the second logic being based on the mission type and the specific size of the vehicle;

wherein the multiple effective vehicle capacities progressively reduce the amount of freight that can be moved by the vehicle, as the number of pooling stops and the number of non-pooling stops increase;

wherein each effective vehicle capacity, in the multiple effective vehicle capacities, is less than the specific size of the vehicle;

a computer automatically deciding on feasibility of performing the mission using the vehicle of the specific size, by comparing the one effective vehicle capacity and a maximum of total freights to be carried by the vehicle at stops in the mission; and

said computer automatically storing in a memory, a result obtained by said computer automatically deciding on feasibility.

2. The computer-implemented method of claim 1 wherein:

the automatically deciding on feasibility comprises computing a penalty cost that depends on a difference between the maximum and the one effective vehicle capacity.

3. The computer-implemented method of claim 1 further comprising:

automatically picking from among all orders for freight movement, said plurality of orders to be consolidated into said mission, when the orders being picked are found by said computer to have at least a partial overlap with one another in respective paths.

4. The computer-implemented method of claim 1 further comprising:

automatically retrieving from a database, said all orders for freight movement including the plurality of orders, by using a database management system; and

automatically storing the mission in said database.

5. The computer-implemented method of claim 1 further comprising:

receiving as inputs through fields in a graphical user interface, said multiple effective vehicle capacities of said vehicle.

6. The computer-implemented method of claim 1 wherein:

the first table is a look up table.

7. The computer-implemented method of claim 1 wherein:

the second table is a look up table.

8. The computer-implemented method of claim 1 wherein:

the mission type is determined by use of the first formula.

9. The computer-implemented method of claim 1 wherein:

the one effective vehicle capacity is determined by use of the second formula.

10. The computer-implemented method of claim 1 wherein:

the one effective vehicle capacity is determined by use of the second logic.

11. One or more non-transitory computer-readable storage media comprising computer executable instructions, when executed by at least one processor perform a computer-implemented method, the computer executable instructions comprising:

instructions to determine unloading/loading complexity of a mission in terms of a mission type, by using a first formula or a first table or a first logic based on a number of pooling stops and a number of non-pooling stops of the mission;

wherein each stop is to be made in executing a plurality of orders for movement of freight to be delivered by a vehicle of a specific size performing the mission;

instructions to determine one effective vehicle capacity among multiple effective vehicle capacities of the vehicle by using a second formula or a second table or a second logic that provides different values for different complexity missions, the second formula or the second table or the second logic being based on the mission type and the specific size of the vehicle;

wherein the multiple effective vehicle capacities progressively reducing the amount of freight that can be moved by the vehicle, as the number of pooling stops and the number of non-pooling stops increase;

wherein each effective vehicle capacity, in the multiple effective vehicle capacities, is less than the specific size of the vehicle;

instructions to decide on feasibility of performing the mission using the vehicle of the specific size, by comparing the one effective vehicle capacity and a maximum of total freights to be carried by the vehicle at stops in the mission; and

instructions to store in a memory, a result of obtained by execution of the instructions to decide on feasibility.

12. The one or more non-transitory computer-readable storage media of claim 11 further comprising:

a graphical user interface comprising fields to receive input on said multiple effective vehicle capacities.

13. The one or more non-transitory computer-readable storage media of claim 11 wherein:

the instructions to decide on feasibility comprise instructions to compute a penalty cost that depends on a difference between the maximum and the one effective vehicle capacity.

14. The one or more non-transitory computer-readable storage media of claim 11 further comprising:

instructions to pick from among all orders for freight movement, said plurality of orders to be consolidated into said mission, when the orders being picked are found to have at least a partial overlap with one another in respective paths.

15. A computer comprising:

a processor and a memory coupled to the processor, the memory being encoded with a computer program comprising instructions executable by said processor to prepare missions for movement of freight using vehicles, wherein said instructions are at least to;

determine unloading/loading complexity of a mission in terms of a mission type, by using a first formula or a first table or a first logic based on a number of pooling stops and a number of non-pooling stops of the mission;

wherein each stop is to be made in executing a plurality of orders for movement of freight to be delivered by a vehicle of a specific size performing the mission;

automatically determine one effective vehicle capacity among multiple effective vehicle capacities of the vehicle by using a second formula or a second table or a second logic that provides different values for different complexity missions, the second formula or the second table or the second logic being based on the mission type and the specific size of the vehicle;

wherein the multiple effective vehicle capacities progressively reduce the amount of freight that can be moved by the vehicle, as the number of pooling stops and the number of non-pooling stops increase;

wherein each effective vehicle capacity, in the multiple effective vehicle capacities, is less than the specific size of the vehicle;

decide on feasibility of performing the mission, using the vehicle of the specific size, by comparing the one effective vehicle capacity and a maximum of total freights to be carried by the vehicle at stops in the mission; and

store in the memory, a result obtained by execution of the instructions to decide on feasibility.

16. The computer of claim 15 further comprising:

a graphical user interface comprising fields to receive input on said multiple effective vehicle capacities.

17. The computer of claim 15 wherein the instructions are further to:

decide on feasibility comprise instructions to compute a penalty cost that depends on a difference between the maximum and the one effective vehicle capacity.

18. The computer of claim 15 wherein the instructions are further to:

pick from among all orders for freight movement, said plurality of orders to be consolidated into said mission, when the orders being picked are found by said computer to have at least a partial overlap with one another in respective paths.

19. An apparatus for preparing missions for movement of freight using vehicles, the apparatus comprising:

means for determining unloading/loading complexity of a mission in terms of a mission type, by using a first formula or a first table or a first logic based on a number of pooling stops and a number of non-pooling stops of the mission;

wherein each stop is to be made in executing a plurality of orders for movement of freight to be delivered by a vehicle of a specific size performing the mission;

means for automatically determining one effective vehicle capacity among multiple effective vehicle capacities of the vehicle by using a second formula or a second table or a second logic that provides different values for different complexity missions, the second formula or the second table or the second logic being based on the mission type and the specific size of the vehicle;

wherein the multiple effective vehicle capacities progressively reduce the amount of freight that can be moved by the vehicle, as the number of pooling stops and the number of non-pooling stops increase;

wherein each effective vehicle capacity, in the multiple effective vehicle capacities, is less than the specific size of the vehicle;

means for deciding on feasibility of performing the mission using the vehicle of the specific size, by comparing the one effective vehicle capacity and a maximum of total freights to be carried by the vehicle at stops in the mission; and

means for storing a result obtained by said means for deciding on feasibility.

20. The apparatus of claim 19 further comprising:

a graphical user interface comprising fields to receive input on said multiple effective vehicle capacities.