Scheduling with layovers and layover charge computation in transportation planning

• US 7,827,051 B2
• Filed: 05/23/2005
• Issued: 11/02/2010
• Est. Priority Date: 05/23/2005
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Sanchez, Javier Nicolas, Yang, Mei, Budaraju, Hema, Peterkofsky, Roy I., Sun, Rongming
• Primary Examiner(s): Sterrett; Jonathan G.
• Assistant Examiner(s): DELICH, STEPHANIE ZAGARELLA
• Application Number:
  US11/136,167
• Publication Number:
  US 20060265264A1
• Time in Patent Office: 1,989 Days
• Field of Search: 705/7, 705/8, 705/9, 705/10
• US Class Current: 705/7.12
• CPC Class Codes: G06Q 10/0631 Resource planning, allocation, distributing or scheduling for enterprises or organisations
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work
• 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

Abstract

A computer, for planning moves of freight automatically adds one or more layover(s) to a mission. Next, the computer determines one or more charge(s) for the layovers, using carriers'"'"' rules. Thereafter, the computer uses the charge(s) in deciding whether to include the mission in a transportation plan to be executed. In some embodiments, the computer automatically maintains, for the given mission, counts of attributes on which limits are imposed by a government or by carriers, such as driving time, on-duty time, and driving distance, and when any count exceeds a corresponding limit in the midst of a driving activity, the computer automatically divides up the current driving activity into a truncated driving activity and a remainder driving activity, separated by a layover activity. The computer also determines an estimated time of arrival, including the impact of required layovers, to reach destination(s), and whether layover(s) is/are required at the destination(s), e.g. due to consignee'"'"'s receiving hours or due to congestion at consignee'"'"'s dock.

Claims

1. One or more computer-readable storage media comprising a plurality of software instructions to perform a computer-implemented method of planning movement of freight, the software instructions comprising:

first instructions to automatically insert a plurality of layovers into a proposed mission to be performed by a truck;

wherein prior to execution of the first instructions, said proposed mission comprises a plurality of destinations wherein freight is loaded into or unloaded from said truck, and the proposed mission further comprises a plurality of activities in addition to said layovers;

wherein on execution of the first instructions, a mandatory layover is inserted between a first portion and a second portion of a driving activity in said plurality of activities, said driving activity being divided up into at least said portions automatically on execution of said first instructions when a first predetermined condition is met, the first predetermined condition comprising a maximum number of hours;

wherein the first instructions comprise instructions to check, prior to the driving activity being divided up, whether addition of the driving activity to a window causes said maximum number of hours to be exceeded, the window identifying a group of said activities occurring within a rolling period of a predetermined number of hours up to 7 days, the mandatory layover being of a duration greater than a predetermined minimum number of hours, the duration of the mandatory layover satisfying at least the first predetermined condition;

wherein the first instructions further comprise instructions to advance the window by removing an earliest activity from the group;

wherein the first instructions further comprise instructions to compute, based on at least the duration of the mandatory layover, an estimated time of arrival of said truck at a destination in the plurality of destinations;

wherein the first instructions further comprise instructions to insert a non-mandatory layover into the proposed mission if a second predetermined condition is met, on an unloading activity to be performed at said destination;

second instructions to a processor to automatically determine and store in a memory coupled to the processor, a yet-to-be-incurred new layover charge for the non-mandatory layover depending at least partially on a rule on chargeability of non-mandatory layovers based on;

the estimated time of arrival of the truck at the destination, a duration of the unloading activity, and hours of operation of a facility at the destination for performing the unloading activity; and

third instructions to prepare and output a plan to move freight to said destination using said truck based at least partially on the yet-to-be-incurred new layover charge and at least one additional cost associated with at least one activity in the plurality of activities.

2. The one or more computer-readable storage media of claim 1 wherein a first counter accumulates hours on duty within a period of said maximum number of hours, a second counter accumulates hours of driving within said period of said maximum number of hours and a third counter accumulates driving distance within said period of said maximum number of hours, the software instructions further comprising:

software instructions to automatically check whether any of the first counter, the second counter and the third counter will exceed a corresponding limit thereon when said driving activity in the mission is performed within said period of said maximum number of hours; and

wherein the second portion of the driving activity is sufficient for only one of said counters to just reach its limit.

3. The one or more computer-readable storage media of claim 2 wherein:

the mandatory layover activity is inserted into the mission immediately after the second portion of the driving activity.

4. The one or more computer-readable storage media of claim 1 wherein said second predetermined condition is based on an estimated time of arrival at a destination in the mission.

5. The one or more computer-readable storage media of claim 1 wherein said second predetermined condition comprises any of:

the estimated time of arrival, follows arrival of another mission, by a duration insufficient to unload freight in both missions before close of business at the destination; and

the estimated time of arrival is prior to the close of business of the destination but precedes the close of business by a duration insufficient to unload freight carried in the mission; and

the estimated time of arrival is after the close of business of the carrier.

6. The one or more computer-readable storage media of claim 1 wherein said first predetermined condition comprises:

hours of driving exceeding a limit set by one of (a government and a carrier).

7. The one or more computer-readable storage media of claim 6 further comprising:

software instructions to automatically use a counter to accumulate total hours of driving to be performed within a period of said maximum number of hours;

software instructions to automatically check whether hours of a driving activity, when added to said counter, will cause said counter to exceed said limit, wherein said driving activity is to be performed between an origin and a destination in said mission;

wherein the second portion of the driving activity is for a number of hours sufficient for said counter to just reach said limit set by government.

8. The one or more computer-readable storage media of claim 7 further comprising:

software instructions to automatically move the period of said maximum number of hours by decrementing the counter, by hours to be spent in an earlier activity already used in incrementing the counter.

9. The one or more computer-readable storage media of claim 8 further comprising:

software instructions to automatically enqueue at the rear of a queue, the driving activity when hours thereof are used to increment the counter; and

software instructions to automatically dequeue from the front of said queue, the earlier activity when hours thereof are used to decrement the counter.

10. The one or more computer-readable storage media of claim 9 wherein:

said queue identifies a plurality of activities to be performed in the mission;

said window is aligned with a front end of said queue; and

said counter represents a sum of hours of all activities related to driving, in said window.

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

software instructions to automatically retrieve from a database, all activities in a mission, by using a database management system; and

software instructions to automatically store the new layover activity in said database.

12. The one or more computer-readable storage media of claim 1 wherein said predetermined condition comprises:

hours of being on duty exceeding a limit set by one of (a government and a carrier).

13. The one or more computer-readable storage media of claim 1 wherein said predetermined condition comprises:

distance being driven exceeding a limit set by one of (a government and a carrier).

14. A computer-implemented apparatus to prepare and output a plan to move freight, the computer-implemented apparatus comprising:

means for automatically inserting a plurality of layovers into a proposed mission to be performed by a truck;

wherein said proposed mission comprises a plurality of destinations at which freight is loaded into or unloaded from said truck, and the proposed mission further comprises a plurality of activities in addition to said layovers;

wherein a mandatory layover is inserted, by said means for automatically inserting, between a first portion and a second portion of a driving activity in said plurality of activities, said driving activity being divided up into at least said portions automatically on execution of said first instructions when a first predetermined condition is met, the first predetermined condition comprising a maximum number of hours;

wherein said means for automatically inserting checks prior to the driving activity being divided up, whether addition of the driving activity to a window causes said maximum number of hours to be exceeded, the window identifying a group of said activities occurring within a rolling period of a predetermined number of hours up to 7 days, the mandatory layover being of a duration greater than a predetermined minimum number of hours, the duration of the mandatory layover satisfying at least the first predetermined condition;

wherein said means for automatically inserting advances the window by removing an earliest activity from the group;

wherein said means for automatically inserting computes, based on at least the duration of the mandatory layover, an estimated time of arrival of said truck at a destination in the plurality of destinations;

wherein said means for automatically inserting further inserts a non-mandatory layover into the proposed mission if a second predetermined condition is met, on an unloading activity to be performed at said destination;

means for automatically determining and storing in a computer memory, a yet-to-be-incurred new layover charge for the non-mandatory layover, depending at least partially on rule on chargeability of non-mandatory layovers based on;

the estimated time of arrival of the truck at the destination, a duration of the unloading activity, and hours of operation of a facility at the destination for performing the unloading activity.

15. The computer-implemented apparatus of claim 14 wherein said means for adding comprises:

means for incrementing a counter by a number of hours to be spent in the driving activity in said mission, unless hours for the driving activity will cause the counter to exceed a limit;

means for adding hours to be spent in the first portion of the activity, to the counter, thereby to increase the counter up to the limit;

means for decrementing the counter, by hours to be spent by an earlier activity that has been already used in incrementing the counter;

wherein the means for dividing is coupled to the means for incrementing to provide thereto the second portion of the activity as the driving activity in said mission.

16. A computer-implemented method of planning movement of freight by using transportation planning software, the computer-implemented method comprising:

automatically inserting a plurality of layovers into a proposed mission to be performed by a truck,

wherein said proposed mission comprises a plurality of destinations wherein freight is loaded into or unloaded from said truck, and the proposed mission further comprises a plurality of activities in addition to said layovers;

wherein on performance of said automatically inserting, a mandatory layover is inserted between a first portion and a second portion of a driving activity in said plurality of activities, said driving activity being divided up into at least said portions automatically on execution of said first instructions when a first predetermined condition is met, the first predetermined condition comprising a maximum number of hours;

wherein said automatically inserting comprises, prior to the driving activity being divided up, checking whether addition of the driving activity to a window causes said maximum number of hours to be exceeded, the window identifying a group of said activities occurring within a rolling period of a predetermined number of hours up to 7 days, the mandatory layover being of a duration greater than a predetermined minimum number of hours, the duration of the mandatory layover satisfying at least the first predetermined condition;

wherein said automatically inserting comprises advancing the window by removing an earliest activity from the group;

wherein said automatically inserting comprises, computing based on at least the duration of the mandatory layover, an estimated time of arrival of said truck at a destination in the plurality of destinations;

wherein said automatically inserting comprises further inserting a non-mandatory layover into the proposed mission if a second predetermined condition is met, on an unloading activity to be performed at said destination; and

using a processor to automatically determine and store in a memory coupled to the processor, a yet-to-be-incurred new layover charge, depending at least partially on a rule on chargeability of non-mandatory layovers based on;

the estimated time of arrival of the truck at the destination, a duration of the unloading activity, and hours of operation of a facility at the destination for performing the unloading activity.

17. The method of claim 16 wherein said first predetermined condition comprises any one of (hours on duty, hours of driving, and driving distance) exceeding a corresponding limit set by one of (a government and a carrier).

18. The method of claim 16 wherein a first counter accumulates hours on duty within a period of said maximum number of hours, a second counter accumulates hours of driving within said period of said maximum number of hours and a third counter accumulates driving distance within said period of said maximum number of hours, and wherein said automatically inserting comprises:

automatically checking whether any of the first counter, the second counter and the third counter will exceed a corresponding limit thereon when a driving activity in the mission is performed within said period of said maximum number of hours; and

wherein the second portion of the driving activity is sufficient for only one of said counters to just reach its limit.

19. The method of claim 16 wherein said automatically inserting comprises:

automatically using a counter to accumulate total hours of driving to be performed within a period of said maximum number of hours;

automatically checking whether hours of a driving activity, when added to said counter, will cause said counter to exceed said limit, wherein said driving activity is to be performed between an origin and a destination in said mission; and

wherein the second portion of the driving activity is for a number of hours sufficient for said counter to just reach said limit set by government.

20. The method of claim 19 wherein said automatically inserting comprises:

automatically moving the period of said maximum number of hours by decrementing the counter, by hours to be spent in said proposed mission, in an earlier activity already used in incrementing the counter.