Systems, methods, and computer program products for improved container transportation
Methods, apparatuses, devices, and computer program products are disclosed for container transportation. An example system includes a conveyor network that includes a plurality of conveyors and each conveyor supports one or more containers thereon. Each conveyor defines a conveyor length and a conveyor operating speed. The system further includes a computing device operably coupled to the conveyor network. The computing device receives a starting location and a destination location of a first container within the conveyor network and receives an operating density for each conveyor in the conveyor network. The computing device determines a first travel path for the first container between the starting location and the destination location based upon the conveyor length, the conveyor operating speed, and the operating density for each conveyor in the conveyor network. The first travel path minimizes a total travel time for the first container between the starting location and the destination location.
1. A system for container transportation comprising:
a conveyor network comprising a plurality of conveyors, wherein each of the conveyors is configured to support one or more containers thereon, each of the conveyors defining:
a conveyor length; and
a conveyor operating speed; and
a computing device operably coupled to the conveyor network, wherein the computing device is configured to:
receive a starting location of a first container within the conveyor network;
receive a destination location of the first container within the conveyor network;
receive an operating density for each of the conveyors in the conveyor network;
determine a first travel path for the first container between the starting location and the destination location based upon the conveyor length, the conveyor operating speed, and the operating density for each of the conveyors in the conveyor network, and
determine a travel time for each of the conveyors in the conveyor network based on one or more of the conveyor length, the conveyor operating speed, the operating density, and historical performance of each of the conveyors in the conveyor network;
wherein the first travel path is configured to minimize a total travel time for the first container between the starting location and the destination location.
2. The system according to claim 1 , wherein the computing device is further configured to:
aggregate the travel times for each set of the conveyors connecting the starting location and the destination location, wherein each set of the conveyors defines a unique travel path for the first container;
determine the total travel time for each set of the conveyors; and
determine the first travel path as the set of conveyors having the shortest total travel time.
3. The system according to claim 1 , wherein the computing device is further configured to:
determine a change in one or more of the conveyor operating speed, the conveyor length, or the operating density of at least one of the conveyors in the first travel path; and
modify the first travel path.
4. The system according to claim 3 , wherein the computing device is further configured to modify a second travel path of a second container in response to modification of the first travel path of the first container.
5. The system according to claim 1 , wherein the conveyor network further comprises a plurality of nodes, wherein each of the nodes is positioned adjacent at least one of the conveyors in the conveyor network.
6. The system according to claim 5 , wherein the computing device is further configured to:
identify a package supported by the container;
determine a node associated with the package; and
modify the first travel path to include the node.
7. The system according to claim 5 , wherein the computing device is further configured to:
identify a package located at a node in the conveyor networking for transporting by the first container; and
modify the first travel path to include the node.
8. A method for container transportation, the method comprising:
receiving a starting location of a first container within a conveyor network, wherein the conveyor network comprises a plurality of conveyors, wherein each of the conveyors is configured to support one or more containers thereon, and wherein each of the conveyors defines a conveyor length and a conveyor operating speed;
receiving a destination location of the first container within the conveyor network;
receiving an operating density for each of the conveyors in the conveyor network; and
determining a first travel path for the first container between the starting location and the destination location based upon the conveyor length, the conveyor operating speed, and the operating density for each of the conveyors in the conveyor network, wherein the first travel path is configured to minimize a total travel time for the first container between the starting location and the destination location; and
determining a travel time for each of the conveyors in the conveyor network based on one or more of the conveyor length, the conveyor operating speed, the operating density, and historical performance of each of the conveyors in the conveyor network.
9. The method according to claim 8 , further comprising:
determining a travel time for each of the conveyors in the conveyor network;
aggregating the travel times for each set of the conveyors connecting the starting location and the destination location, wherein each set of the conveyors defines a unique travel path for the first container;
determining the total travel time for each set of the conveyors; and
determining the first travel path as the set of conveyors having the shortest total travel time.
10. The method according to claim 8 , further comprising:
determining a change in one or more of the conveyor operating speed, the conveyor length, or the operating density of at least one of the conveyors in the first travel path; and
modifying the first travel path.
11. The method according to claim 10 , further comprising modifying a second travel path of a second container in response to modification of the first travel path of the first container.
12. The method according to claim 8 , wherein the conveyor network further comprises a plurality of nodes, wherein each of the nodes is positioned adjacent at least one of the conveyors in the conveyor network.
13. The method according to claim 12 , further comprising:
identifying a package supported by the container;
determining a node associated with the package; and
modifying the first travel path to include the node.
14. The method according to claim 12 , further comprising:
identifying a package located at a node in the conveyor networking for transporting by the first container; and
modifying the first travel path to include the node.
15. 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 a starting location of a first container within a conveyor network, wherein the conveyor network comprises a plurality of conveyors, wherein each of the conveyors is configured to support one or more containers thereon, and wherein each of the conveyors defines a conveyor length and a conveyor operating speed;
receive a destination location of the first container within the conveyor network;
receive an operating density for each of the conveyors in the conveyor network; and
determine a first travel path for the first container between the starting location and the destination location based upon the conveyor length, the conveyor operating speed, and the operating density for each of the conveyors in the conveyor network, wherein the first travel path is configured to minimize a total travel time for the first container between the starting location and the destination location and
determine a travel time for each of the conveyors in the conveyor network based on one or more of the conveyor length, the conveyor operating speed, the operating density, and historical performance of each of the conveyors in the conveyor network.
16. The computer program product according to claim 15 , wherein the computer-readable program code portions comprising the executable portion are configured to:
determine a travel time for each of the conveyors in the conveyor network;
aggregate the travel times for each set of the conveyors connecting the starting location and the destination location, wherein each set of the conveyors defines a unique travel path for the first container;
determine the total travel time for each set of the conveyors; and
determine the first travel path as the set of conveyors having the shortest total travel time.
17. The computer program product according to claim 15 , wherein the computer-readable program code portions comprising the executable portion are configured to:
determine a change in one or more of the conveyor operating speed, the conveyor length, or the operating density of at least one of the conveyors in the first travel path; and
modify the first travel path.
18. The computer program product according to claim 15 , wherein the computer-readable program code portions comprising the executable portion are configured to modify a second travel path of a second container in response to modification of the first travel path of the first container.
19. The computer program product according to claim 15 , wherein the computer-readable program code portions comprising the executable portion are configured to
identifying a package supported by the container;
determining a node associated with the package; and
modifying the first travel path to include the node.
20. The computer program product according to claim 15 , wherein the computer-readable program code portions comprising the executable portion are configured to
identifying a package located at a node in the conveyor networking for transporting by the first container; and
modifying the first travel path to include the node.