Systems and methods for managing a transportation plan

An apparatus comprising at least one processor and at least one memory including program code, the at least one memory and the program code configured to, with the processor, cause the apparatus to at least:

• receive, by communicating with one or more user computing entities and one or more mobile computing devices through a computer network, information identifying a schedule to be removed, the schedule being one of a plurality of schedules for a transportation plan;
• identify one or more loads assigned to the schedule;
• for a load of the one or more loads, determining one or more potential replacement schedules to accommodate the load based on a level of near real-time remaining load capacity of at least one segment of the one or more potential replacement schedules being able to accommodate a plurality of load attributes of the load, wherein the plurality of load attributes comprises a load origin location, a load destination location, and a load size;
• ranking the one or more potential replacement schedules as a best one to meet delivery and schedule commitments based on at least one of miles that will be traveled, special handling instructions associated with the load information, time arrival at a destination location, number of potential schedules that would need to be modified, time of departure, expected weather conditions, or an extent of modification of a schedule;
• generating graphical information indicating that the schedule can be removed and also providing information relating to the one or more potential replacement schedules for display on a first graphical user interface (GUI) that enables a user to confirm the one or more potential replacement schedules;
• automatically displaying via the at least one of one or more user computing entities and the one or more mobile computing devices by transmitting through the computer network, the highest ranked of the one or more potential replacement schedules at a top of the first GUI followed by a remaining next highest ranked of the one or more potential replacement schedules;
• responsive to not receiving user confirmation, automatically reassigning the load to the highest ranked of the one or more potential replacement schedules and updating the schedule of the highest ranked of the one or more potential replacement schedules;
• and
• automatically displaying in real time, via the at least one of one or more user computing entities and the one or more mobile computing devices by generating and transmitting a second GUI over the computer network, wherein the second GUI is configured to display reassignment information regarding the one or more potential replacement schedules to which the load have been reassigned.

A computer program product comprising at least one non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:

• an executable portion configured to receive, by communicating with one or more user computing entities and one or more mobile computing devices through a computer network, information identifying a schedule to be removed, the schedule being one of a plurality of schedules for a transportation plan;
• an executable portion configured to identify one or more loads assigned to the schedule;
• an executable portion configured to determine one or more potential replacement schedules to accommodate a load of the one or more loads based on a level of near real-time remaining load capacity of at least one segment of the one or more potential replacement schedules being able to accommodate a plurality of load attributes of the load, wherein the plurality of load attributes comprises a load origin location, a load destination location, and a load size;
• an executable portion configured to rank the one or more potential replacement schedules as a best one to meet delivery and schedule commitments based on at least one of miles that will be traveled, special handling instructions associated with the load information, time arrival at a destination location, number of potential schedules that would need to be modified, time of departure, expected weather conditions, or an extent of modification of a schedule;
• an executable portion configured to generate graphical information indicating that the schedule can be removed and also providing information relating to the one or more potential replacement schedules for display on a first graphical user interface (GUI) that enables a user to confirm the one or more potential replacement schedules;
• automatically displaying via the at least one of one or more user computing entities and the one or more mobile computing devices by transmitting through the computer network, the highest ranked of the one or more potential replacement schedules at a top of the first GUI followed by a remaining next highest ranked of the one or more potential replacement schedules;
• responsive to not receiving user confirmation, automatically reassigning the load to the highest ranked of the one or more potential replacement schedules and updating the schedule of the highest ranked of the one or more potential replacement schedules;
• and
• automatically displaying in real time, via the at least one of one or more user computing entities and the one or more mobile computing devices by generating and transmitting a second GUI over the computer network, wherein the second GUI is configured to display reassignment information regarding the one or more potential replacement schedules to which the load have been reassigned.