| CPC G06Q 10/0833 (2013.01) [G06Q 10/0838 (2013.01)] | 21 Claims |
|
1. A method of optimizing and mitigating traffic and scheduling for cargo and transport-unit comprising:
accessing, by a processor, data of a transport unit, wherein a computing device includes the processor, wherein the processor is coupled with a memory, and wherein the processor is configured to communicate with a user device;
accessing, by the processor, a load-list associated with a facility and selecting a load with a pending stop from the load-list, wherein the pending stop is selected according to shipment data associated with the load;
determining, by the processor, whether the pending stop does or does not have an assigned schedule:
when determined that the pending stop does not have the assigned schedule, assigning, by the processor, a schedule to the pending stop, wherein the schedule includes a deadline, and wherein the schedule is determined according to a first set of rules; and
when determined that the pending stop does have the assigned schedule:
when determined that the assigned schedule for the pending stop is a committed-timeslot, selecting, by the processor, a start of the committed-timeslot as the deadline of the schedule; and
when determined that the assigned schedule for the pending stop is a time-range:
reserving, by the processor, a floating-timeslot for a compatible resource associated with the facility; and
selecting, by the processor, an end of the time-range as the deadline of the schedule;
after selecting the deadline of the schedule for the pending stop:
acquiring, by the processor, the data of the transport-unit, wherein the data of the transport-unit is transmitted from an on-board device of the transport-unit associated with the pending stop; and
determining, by the processor, a minimum required travel time for the transport-unit to the pending stop by factoring in any associated limitation of the transport-unit; and
determining, by the processor, an arrival-status based on a comparison of the minimum required travel time for the transport-unit and a remaining amount of time to the deadline, wherein the arrival status is on-time or unrecoverable-delay;
when the arrival-status is determined to be the unrecoverable delay, adjusting, by the processor, the schedule based on a second set of rules; and
when the arrival-status is determined to be the on-time:
when the deadline is determined to be the committed-timeslot, re-selecting, by the processor, the load with the pending stop from the load-list; and
when the deadline is determined to be the time-range:
generating, by the processor, one or more boundaries associated with the compatible resource of the facility;
selecting, by the processor, any transport-unit compatible with the one or more boundaries;
switching, by the processor, the floating time-slot for the transport-unit according to a third set of rules; and
assigning, by the processor, the committed time-slot to the transport-unit, wherein the committed time-slot is determined according to the third set of rules; and
in response to detecting a change in at least one of: the data of the transport-unit, data of the facility associated with the compatible resource, and the shipment data associated with the load, performing an associated action by conforming to a fourth set of rules, wherein performing the associated action includes:
generating, by the processor, an updated schedule according to the fourth set of rules; and
conducting, via one or more instructions communicated by the processor, loading or unloading of the transport-unit by the compatible resource in accordance with the updated schedule or controlling, via one or more instructions communicated by the processor, arrival of the transport-unit in accordance with the updated schedule.
|